How michaelidan/sys_pro_2_ex1_2_april works
Project type and purpose
• This is a C++ library + CLI demo for an undirected weighted graph data structure (adjacency‐list) implemented without STL, plus classical graph algorithms (BFS, DFS, Dijkstra, Prim, Kruskal).
• It also includes a console “main” driver and a unit‐test harness based on doctest.
File structure
Top‐level files & directories:
• Graph.h/.cpp – the graph core
• DataStructures.h/.cpp – supporting DS (Queue, PriorityQueue, UnionFind)
• Algorithms.h/.cpp – implements BFS, DFS, Dijkstra, Prim, Kruskal over Graph
• main.cpp – demo application
• tests.cpp + doctest.h – unit tests
• Makefile – build & run scripts
Architectural patterns:
• Core library modules with clear dependency chain: DataStructures → Graph → Algorithms
• Two “clients” of the library: main app and the test suite
• Build orchestration via Makefile
README for additional insights
• All DS are home‐grown (no std::vector, no std::queue)
• Algorithms return new Graph instances (trees or shortest‐paths)
• Test suite uses doctest.h; Makefile supports build/test/valgrind