Main Content

graphtopoorder

(To be removed) Perform topological sort of directed acyclic graph

graphtopoorder will be removed in a future release. Use toposort instead.

Syntax

order = graphtopoorder(G)

Arguments

G N-by-N adjacency matrix that represents a directed acyclic graph. Nonzero entries in matrix G indicate the presence of an edge.

Description

Tip

For introductory information on graph theory functions, see Graph Theory Functions.

order = graphtopoorder(G) returns an index vector with the order of the nodes sorted topologically. In topological order, an edge can exist between a source node u and a destination node v, if and only if u appears before v in the vector order. G is an N-by-N adjacency matrix that represents a directed acyclic graph (DAG). Nonzero entries in matrix G indicate the presence of an edge.

References

[1] Siek, J.G., Lee, L-Q, and Lumsdaine, A. (2002). The Boost Graph Library User Guide and Reference Manual, (Upper Saddle River, NJ:Pearson Education).

Version History

Introduced in R2006b

expand all

Warns starting in R2022a

Behavior changed in R2021b

See Also