networkx.algorithms.dag.dag_longest_path

dag_longest_path(G, weight='weight', default_weight=1, topo_order=None)[source]

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
  • topo_order (list or tuple, optional) – A topological order for G (if None, the function will compute one)
Returns:

Longest path

Return type:

list

Raises:

NetworkXNotImplemented – If G is not directed