search

mmcs-ruby / visual_graphs

MIT License
2 stars 15 forks source link

Implement graph algorithm: Prim's (for adjacency list based graph) #10

Open handlessdude opened 2 years ago

handlessdude commented 2 years ago

The result must be a new graph with corresponding base presenting the minimum spanning tree for a given weighted undirected graph