From: Joel Young (jdy_at_[hidden])
Date: 2002-10-14 15:05:33
Does anyone have a longest path algorithm sitting around for
boost graphs (adjacency_list, bidirectional)?
Output should be a mapping of longest path values onto each vertex and a
optionally a mapping of longest path parent onto each vertex.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk