René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Minimum Spanning Tree Algorithms","articleBody":"### Description\nImplement Kruskal's and Prim's algorithms for finding minimum spanning trees, and add verification logic to check if a student's submitted tree is a valid MST.\n\n### Tasks\n- [ ] Implement Kruskal's algorithm with union-find data structure\n- [ ] Implement Prim's algorithm with priority queue\n- [ ] Add MST verification (check if tree is spanning and minimum weight)\n- [ ] Support both algorithms with auto-selection\n- [ ] Handle disconnected graphs gracefully\n- [ ] Write unit tests with various graph configurations\n- [ ] Add visualization support for MST edges\n\n### Acceptance Criteria\n- Both algorithms produce correct MSTs\n- Verification correctly identifies valid/invalid MSTs\n- Works with weighted graphs\n- Handles edge cases (single node, disconnected components)\n- Unit tests achieve \u003e90% coverage\n","author":{"url":"https://github.com/JohnnyWan1123","@type":"Person","name":"JohnnyWan1123"},"datePublished":"2026-01-29T19:55:10.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/6/graph-eval/issues/6"}