dalicious ~master (2019-07-04T14:03:58Z)

Graph.has

daliciousmathGraph

Check if edge/node exists in this graph. Ignores the weight if weighted.

  1. bool has(in Node node)
    struct Graph(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
    bool
    has
    const pure nothrow
    (
    in Node node
    )
  2. bool has(in Edge edge)
  3. bool opBinaryRight(in Node node)

Meta

Source

See Implementation

daliciousmathGraph constructorsfunctionspropertiesstatic functionsstructs

Page generated by adrdox