| Function dag_shortest_path Computes shortest paths from a single source in a directed acyclic graph (DAG). dag_shortest_path(g, source, weight, predecessor, distance) Parameters
g | In-parameter:A directed acyclic graph. Types: Directed graph
source | In-parameter:A source vertex. Types: VertexDescriptor
weight | In-parameter:A weight map. Remarks: In a directed acyclic graph edge weights can be negative because no cycles do exist.
predecessor | Out-parameter:A property map. Remarks: A property map that represents predecessor relationships among vertices. It determines a shortest-paths tree.
distance | Out-parameter:A property map. Remarks: Indicates for each vertex the distance from the source.
Return Values void. Example Programs Shortest Path in DAGs See Also bellman_ford_algorithm, dijkstra SeqAn - Sequence Analysis Library - www.seqan.de