GitHub / Blargian / min_span_tree_visualizer
A tool to visualize how algorithms for finding minimum spanning trees work. Complete with random generation of tree structures using Delaunay triangulation or option to import your own.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Blargian%2Fmin_span_tree_visualizer
Stars: 0
Forks: 1
Open issues: 1
License: mit
Language: C++
Size: 28 MB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: 4 months ago
Pushed at: over 1 year ago
Last synced at: about 1 month ago
Topics: algorithm, algorithms-and-data-structures, catch2, cmake, cpp, dear-imgui, delaunay-triangulation, educational, graph, greedy-algorithms, help-wanted, imgui, imgui-glfw, implot, kruskal, kruskal-algorithm, minimum-spanning-tree, prims-algorithm, prims-mst, visualization