dhart.pathfinding

Description

Find paths between points within a graph

All path algorithms are implemented using the Boost Graph Library.

Classes

Path(path_ptr, data_ptr, size)	A list of path members from C++
PathMemberStruct	A node in a path.

Functions

ConvertNodesToIds(graph, nodes)	Get ids for nodes in graph.
DijkstraFindAllShortestPaths(graph[, cost_type])	Find All Pairs Shortest Path
DijkstraShortestPath(graph, start, end[, ...])	Find the shortest path from start to end using Dijkstra's shortest path algorithm
calculate_distance_and_predecessor(graph[, ...])	Calculate distance and predecessor matricies for a graph in C++