Graph/SingleSourceShortestPath/dense.cxx File Reference

Dijkstra's implementation for dense graphs. More...

#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.


Detailed Description

Dijkstra's implementation for dense graphs.

Contains implementation of Dijkstra's Algorithm for solving Single Source Shortest Path problems. Targeted primarily for Dense graphs.

Author:
George Heineman
Date:
6/15/08

Function Documentation

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