Pathing DLL

Allows creating graphs and finding paths by using Dijkstra or ALT algorithms.

Example Usage

Dijkstra

PathingLib::Graph g = PathingLib::Graph::loadGraphFromFile("graphNodes.txt", "graphEdges.txt");
PathingLib::Path p = PathingLib::Dijkstra::getPath(0, 5, g);
cout << "Path distance: " << p.getDistance('m');

ALT

PathingLib::Graph g = PathingLib::Graph::loadGraphFromFile("graphNodes.txt", "graphEdges.txt");
PathingLib::ALT alt(g, 4);
PathingLib::Path p = alt.getPath(0, 1000);
cout << "Path distance: " << p.getDistance('m');

For better clarity see documentation and example client.

Graphic result

Result of example client.

Made by using

• C++ 14
• Microsoft Visual Studio 2017
• Microsoft Visual C++ 2017 14.10.25008

License

MIT