A simple, but pratical graph (from graph theory, not like plots and charts) C++ Library
To test this code or run it stand alone, you must use the main.cpp. You must complie all codes together, and then run output compiled code passing the arguments as follows: ./main <input_graph.txt> <selected vertice - optional> <target vertice - optional>
The implemented algorithms (and how to write then on the code in parentheses) so far are: Breadth-first search (BFS) - requires selected vertices to start the search Depth-first search (DFS) - requires selected vertices to start the search Diameter (diameter) Distance (distance) - requires two vertices to have the distance measured
This library can manipulate weighted graphs. It has the dijkstra algorithm for minimum path implemented, as well a mst (minimum spanning tree) and eccentricity. The library detects if the input graph has weights automatically, but only handles it with list, not matrix.
Examples:
// BFS using adjacency list, root -> node 1
./main graph_file.txt list BFS 1
=================================
// Distance between nodes 1 and 2:
./main graph_file.txt x distance 1 2