https://github.com/mestolopomello/mst-prim
Prim's Minimum Spanning Tree algorithm for weighted undirected graphs, written in Prolog and Common Lisp. It uses a binary heap to store the vertices' keys.
https://github.com/mestolopomello/mst-prim
common-lisp mst prim-algorithm prolog
Last synced: 24 days ago
JSON representation
Prim's Minimum Spanning Tree algorithm for weighted undirected graphs, written in Prolog and Common Lisp. It uses a binary heap to store the vertices' keys.
- Host: GitHub
- URL: https://github.com/mestolopomello/mst-prim
- Owner: MestoloPomello
- Created: 2021-06-24T23:24:09.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2021-06-24T23:25:08.000Z (almost 4 years ago)
- Last Synced: 2025-02-15T00:29:22.426Z (3 months ago)
- Topics: common-lisp, mst, prim-algorithm, prolog
- Language: Common Lisp
- Homepage:
- Size: 10.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files: