This is a makeshift implementation of the Kruskal's algorithm for finding the Minimum Spanning Tree implemented in Pascal, tested on Atari 8-bit.
The idea is to connect Vertices in a graph (cities) with edges (roads) in an efficient way.
-
Notifications
You must be signed in to change notification settings - Fork 0
mgr-inz-rafal/atari_msp_test
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published