CodePlexProject Hosting for Open Source Software

The Hoffman-Pavlet algorithm provides an implementation this problem for directed weight graph with positive weights.

IBidirectionalGraph<TVertex, TEdge> g = ...; Func<TEdge, double> edgeWeights = ...; TVertex source = ...; TVertex target = ...; int pathCount = 5; foreach(IEnumerable<TEdge> path in g.RankedShortestPathHoffman(g, edgeWeights, source, target, 5)) ...

Last edited Jan 4, 2009 at 11:03 PM by pelikhan, version 4

Does anybody know what the computational complexity of this implementation is? I have tried looking in the paper, but as far as I can tell, that is not stated explicitly. Thanks in advance.

Hoffman-Pavley is spelt incorrectly on this page.