sequential_chain()

EdgeList MayaFlux::Kinesis::sequential_chain

(

const Eigen::MatrixXd &

points

)

Compute sequential chain graph.

Parameters

points

Dx N matrix where each column is a point

Returns

Edge list (point index pairs)

Connects points in order: (0,1), (1,2), ..., (n-2, n-1). Undirected graph: each edge appears once.

Complexity: O(n)

Definition at line 26 of file ProximityGraphs.cpp.

{
    Eigen::Index n = points.cols();
    if (n < 2) {
        return {};
    }
 
    EdgeList edges;
    edges.reserve(n - 1);
 
    for (Eigen::Index i = 0; i < n - 1; ++i) {
        edges.emplace_back(static_cast<size_t>(i), static_cast<size_t>(i + 1));
    }
 
    MF_DEBUG(Journal::Component::Kinesis, Journal::Context::Runtime,
        "sequential_chain: {} points, generated {} edges", n, edges.size());
 
    return edges;
}

References MayaFlux::Journal::Kinesis, MF_DEBUG, and MayaFlux::Journal::Runtime.

Referenced by generate_proximity_graph().

Here is the caller graph for this function: