dalicious v2.4.0 (2020-01-14T14:23:24Z)

Graph.has

dalicious math Graph

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)
    const pure nothrow
    bool
    has
    (
    in Edge edge
    )
  3. bool opBinaryRight(Edge edge)

Meta

Source

See Implementation

dalicious math Graph constructorsfunctionspostblitspropertiesstatic functionsstatic variablesstructsvariables

Page generated by adrdox