o
    3Î®cK  ã                   @   s,   d Z ddlmZmZmZmZmZ g d¢ZdS )a  
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Úcontracted_nodesÚequivalence_classesÚidentified_nodesÚquotient_graphN)Ú__doc__Ú&networkx.algorithms.minors.contractionr   r   r   r   r   Ú__all__© r
   r
   úJ/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/minors/__init__.pyÚ<module>   s    