Skip to main content
`Ctrl`+`K`

# Minors

Subpackages related to graph-minor problems.

In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges [1].

## References

[1]

https://en.wikipedia.org/wiki/Graph_minor

`contracted_edge`(G, edge[, self_loops, copy]) | Returns the graph that results from contracting the specified edge.
`contracted_nodes`(G, u, v[, self_loops, copy]) | Returns the graph that results from contracting `u` and `v`.
`identified_nodes`(G, u, v[, self_loops, copy]) | Returns the graph that results from contracting `u` and `v`.
`equivalence_classes`(iterable, relation) | Returns equivalence classes of `relation` when applied to `iterable`.
`quotient_graph`(G, partition[, ...]) | Returns the quotient graph of `G` under the specified equivalence relation on nodes.