I suggest adding a variant of the Graphs module for undirected graphs, in which edges are represented as unordered pairs {a,b} of nodes, thus enforcing symmetry. The module contains a union-find based operator for computing connected components of an undirected graph.
I suggest adding a variant of the Graphs module for undirected graphs, in which edges are represented as unordered pairs {a,b} of nodes, thus enforcing symmetry. The module contains a union-find based operator for computing connected components of an undirected graph.