Graph.indexOf

Returns the index of node n in the list of nodes.

  1. size_t indexOf(Node n)
    struct Graph(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
    const
    size_t
    indexOf
    (
    in Node n
    )
  2. size_t indexOf(Edge edge)

Examples

auto g1 = Graph!(int, int)([1, 2]);

assert(g1.indexOf(1) == 0);
assert(g1.indexOf(2) == 1);
assertThrown!MissingNodeException(g1.indexOf(3));

Meta