Function

dagShortestPath

Computes shortest paths from a single source in a directed acyclic graph (DAG).

Include Headers

seqan/graph_algorithms.h

Parameters

In-parameter:A directed acyclic graph. Types: Directed Graph | |

In-parameter:A source vertex. Types: VertexDescriptor | |

In-parameter:A weight map. Remarks: In a directed acyclic graph edge weights can be negative because no cycles do exist. | |

Out-parameter:A property map. Remarks: A property map that represents predecessor relationships among vertices. It determines a shortest-paths tree. | |

Out-parameter:A property map. Remarks: Indicates for each vertex the distance from the source. |

Return Values

void.

Example Programs

See Also

SeqAn - Sequence Analysis Library - www.seqan.de