networkx.algorithms.dag.dag_longest_path¶
-
dag_longest_path
(G, weight='weight', default_weight=1)[source]¶ Returns the longest path in a directed acyclic graph (DAG).
If
G
has edges withweight
attribute the edge data are used as weight values.Parameters: - G (NetworkX DiGraph) – A directed acyclic graph (DAG)
- weight (str, optional) – Edge data key to use for weight
- default_weight (int, optional) – The weight of edges that do not have a weight attribute
Returns: Longest path
Return type: list
Raises: NetworkXNotImplemented
– IfG
is not directedSee also