Coverage for /pythoncovmergedfiles/medio/medio/usr/local/lib/python3.9/dist-packages/networkx/algorithms/minors/__init__.py: 100%

1""" 

2Subpackages related to graph-minor problems. 

3 

4In graph theory, an undirected graph H is called a minor of the graph G if H 

5can be formed from G by deleting edges and vertices and by contracting edges 

6[1]_. 

7 

8References 

9---------- 

10.. [1] https://en.wikipedia.org/wiki/Graph_minor 

11""" 

12 

13from networkx.algorithms.minors.contraction import ( 

14 contracted_edge, 

15 contracted_nodes, 

16 equivalence_classes, 

17 identified_nodes, 

18 quotient_graph, 

19) 

20 

21__all__ = [ 

22 "contracted_edge", 

23 "contracted_nodes", 

24 "equivalence_classes", 

25 "identified_nodes", 

26 "quotient_graph", 

27]