graph

graph / JKruskalMinimumSpanningTree / 0.1.0

README.md
Uses Kruskal's algorithm. If the given graph is connected it computes the minimum spanning tree, otherwise it computes the minimum spanning forest. 

Inputs:
  • A graph represented as a map from vertices (strings) to a list of neighbors (list of strings) OR the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)