dentist ~master (2019-01-03T11:08:59Z)

Graph.has

dentistutilmathGraph

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

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

Meta

Source

See Implementation

dentistutilmathGraph constructorsfunctionspropertiesstatic functionsstructs

Page generated by adrdox