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

UndirectedGraph.this

dalicious math UndirectedGraph

Construct a graph from a set of nodes (and edges).

  1. this(Node[] nodes)
    struct UndirectedGraph(Node, Weight = void)
    this
    (
    Node[] nodes
    )
  2. this(Node[] nodes, Edge[] edges)

Throws

NodeExistsException if a node already exists when trying to insert it. EdgeExistsException if an edge already exists when trying to insert it.

Meta

Source

See Implementation

dalicious math UndirectedGraph aliasesconstructorsfunctionspropertiesstatic functionsstatic variablesstructsvariables

Page generated by adrdox