Satsuma
a delicious .NET graph library
|
Finds the cutvertices and blocks (2-node-connected components) of a graph. More...
Public Types | |
enum | Flags { None = 0, CreateComponents = 1 << 0, CreateCutvertices = 1 << 1 } |
Public Member Functions | |
BiNodeConnectedComponents (IGraph graph, Flags flags=0) | |
Properties | |
List< HashSet< Node > > | Components [get, set] |
The blocks (2-node-connected components) of the graph. More... | |
int | Count [get, set] |
The number of blocks (2-node-connected components) in the graph. More... | |
Dictionary< Node, int > | Cutvertices [get, set] |
Stores the increase in the number of connected components upon deleting a node. More... | |
IGraph | Graph [get, set] |
The input graph. More... | |
Finds the cutvertices and blocks (2-node-connected components) of a graph.
Blocks (2-node-connected components) are maximal 2-node-connected subgraphs and bridge arcs.
Definition at line 448 of file Connectivity.cs.
Enumerator | |
---|---|
None | |
CreateComponents |
If set, Components will contain the 2-edge-connected components. |
CreateCutvertices |
If set, Cutvertices will contain information about the cutvertices. |
Definition at line 451 of file Connectivity.cs.
Definition at line 540 of file Connectivity.cs.
|
getset |
The blocks (2-node-connected components) of the graph.
Null if Flags.CreateComponents was not set during construction.
Definition at line 466 of file Connectivity.cs.
|
getset |
The number of blocks (2-node-connected components) in the graph.
Definition at line 463 of file Connectivity.cs.
|
getset |
Stores the increase in the number of connected components upon deleting a node.
Null if Flags.CreateCutvertices was not set during construction. The only keys are cutvertices (value > 0) and one-node components (value = -1). Other nodes are not contained as keys, as they would all have 0 value assigned.
Definition at line 471 of file Connectivity.cs.
|
getset |
The input graph.
Definition at line 461 of file Connectivity.cs.