Data structure to find components in undirected graphs in python
<p>an undirected graph from is represented as a pair of nodes:</p>

<p>edges = (A,B),(B,C),(D,E),(F,E),(G,E),(G,I),(H,G)</p>

<p>What should be the best data structure in python to find the components of a </p>

<p>specific sub graph given a starting edge (e.g. </p>

<p>(D,E))?. I am thinking in using depth first search as the searching algorithm.</p>
