Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs (Q1029013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5576893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs |
scientific article; zbMATH DE number 5576893 |
Statements
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs (English)
0 references
9 July 2009
0 references
topological sorting
0 references
incremental updating
0 references
graph algorithms
0 references
DAG
0 references
space complexity
0 references
0.8449922800064087
0 references
0.8268587589263916
0 references
0.7914695143699646
0 references
0.7831745147705078
0 references
0.7768155932426453
0 references
