FindSet returns the DisjointSet with the represent name.

Kruskal finds the minimum spanning tree with disjoint-set data structure.

MakeDisjointSet creates a DisjointSet.

NewForests creates a new Forests.

NewGraph returns a new graph.

NewGraph returns a new graph.

NewGraphFromJSON returns a new Graph from a JSON file.

NewGraphFromJSON returns a new Graph from a JSON file.

Prim finds the minimum spanning tree with min-heap (priority queue).

Union unions two DisjointSet, with ds1's represent.

DisjointSet implements disjoint set.

Forests is a set of DisjointSet.

Edge connects between two Nodes.

Edge connects between two Nodes.

Graph describes the methods of graph operations.

Graph describes the methods of graph operations.

ID is unique identifier.

ID is unique identifier.

Node is vertex.

Node is vertex.