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

Graph.this

daliciousmathGraph

Construct a graph from a set of nodes (and edges). Modifies nodes while sorting but releases it after construction.

  1. this(Node[] nodes)
  2. this(Node[] nodes, Edge[] edges)
    struct Graph(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
    this
    (
    Node[] nodes
    ,
    Edge[] edges
    )

Throws

MissingNodeException if an edge has a node that is not present in this graph . EdgeExistsException if an edge already exists when trying inserting it.

Meta

Source

See Implementation

daliciousmathGraph constructorsfunctionspropertiesstatic functionsstructs

Page generated by adrdox