tusc.graph.enumeration

graph.enumeration.count_cut_edges(G)

Count the loop edges in a graph.

Parameters

G (NetworkX graph) –

graph.enumeration.count_loops(G)

Count the loop edges in a graph.

Parameters

G (NetworkX graph) –

graph.enumeration.count_spanning_trees(G)

Employs Matrix-Tree Thm to count the spanning trees of a graph.

Parameters

G (NetworkX graph) –

References

[1] Kirchhoff’s theorem. Wikipedia. Retrieved from https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem.

graph.enumeration.get_cut_edges(G)

Returns the cut-edges in a graph.

Parameters

G (NetworkX graph) –

graph.enumeration.get_loops(G)

Returns the loop edges in a graph.

Parameters

G (NetworkX graph) –