8c2a5290ad
- Document the existence of the biconnected components algorithm libs/graph/example/biconnected_components.cpp: - Clean up the GraphViz output a bit libs/graph/doc/figs/biconnected.dot, libs/graph/doc/figs/biconnected.png, libs/graph/doc/biconnected_components.html: - Documentation for biconnected components and articulation points boost/graph/biconnected_components.hpp: - Minor type tweaks [SVN r26105]
18 lines
350 B
Plaintext
18 lines
350 B
Plaintext
graph A {
|
|
node[shape="circle"]
|
|
B [ style="filled", fillcolor="red" ];
|
|
G [ style="filled", fillcolor="red" ];
|
|
A [ style="filled", fillcolor="red" ];
|
|
A -- F[label="1"]
|
|
A -- B[label="1"]
|
|
A -- G[label="3"]
|
|
B -- C[label="0"]
|
|
B -- D[label="0"]
|
|
B -- E[label="1"]
|
|
C -- D[label="0"]
|
|
E -- F[label="1"]
|
|
G -- I[label="2"]
|
|
G -- H[label="2"]
|
|
H -- I[label="2"]
|
|
}
|