Topological sort

Versione 1.1.0.0 (2,08 KB) da Jan Motl
Performs topological sort of a directed graph
0.0
(0)
136 download
Aggiornato 22 feb 2016

Visualizza la licenza

Topological sort orders nodes in a directed graph that way that for every directed edge uv from node u to node v, u comes before v in the ordering.
An interesting property of this topological sort is that this implementation permits existence of cycles in the graph.

The function is an implementation of an algorithm described in: "A Simple Algorithm for Automatic Layout of BPMN Processes" (http://dx.doi.org/10.1109/CEC.2009.28).

Assumptions:
1) The graph is directed.
2) The graph has at least one node without any incoming link.
3) The edges are not weighted.

Cita come

Jan Motl (2024). Topological sort (https://www.mathworks.com/matlabcentral/fileexchange/55538-topological-sort), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2015a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Directed Graphs in Help Center e MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.1.0.0

Flatten directory structure
1.0.0.0