#include "Graph.h"
Functions | |
| void | outputDense (int n, vector< int > &dist, vector< int > &pred) |
| Useful debugging function. | |
| void | singleSourceShortest (Graph const &graph, int s, vector< int > &dist, vector< int > &pred) |
| Interface to single source Shortest Path problem. | |
Contains implementation of Dijkstra's Algorithm for solving Single Source Shortest Path problems. Targeted primarily for Dense graphs.
| void outputDense | ( | int | n, | |
| vector< int > & | dist, | |||
| vector< int > & | pred | |||
| ) |
Useful debugging function.
| void singleSourceShortest | ( | Graph const & | graph, | |
| int | s, | |||
| vector< int > & | dist, | |||
| vector< int > & | pred | |||
| ) |
Interface to single source Shortest Path problem.
Suitable for Dense Graphs Only.
Algorithm Development Kit 1.0