A graph library for Scala 3.
-
Updated
Mar 20, 2024 - Scala
A graph library for Scala 3.
A weighted graph data structure capable of doing common algorithms such as dijkstra shoretest path, DFS, BFS, Sollin(Boruvka),Prim MST, Kruskal MST, Eulerian path, Hamiltonian cycle Algorithms and more.
Minimum Spanning Tree implementation in C++17 using Prim and Kruskal algorithms
Add a description, image, and links to the prim-mst topic page so that developers can more easily learn about it.
To associate your repository with the prim-mst topic, visit your repo's landing page and select "manage topics."