Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

networkx.algorithms.dag.dag_longest_path

dag_longest_path(G, weight='weight', default_weight=1)

Returns the longest path in a directed acyclic graph (DAG).

If G has edges with weight 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 – If G is not directed

See also

dag_longest_path_length()