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

Graph.has

daliciousmathGraph

Check if edge exists in this graph. Only the start and end node will be compared.

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

Meta

Source

See Implementation

daliciousmathGraph constructorsfunctionspropertiesstatic functionsstructs

Page generated by adrdox