Path-based strong component algorithm
In graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by , , , , and ; of these, Dijkstra's version was the first to achieve linear time.
- Comment
- enIn graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by , , , , and ; of these, Dijkstra's version was the first to achieve linear time.
- Has abstract
- enIn graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by , , , , and ; of these, Dijkstra's version was the first to achieve linear time.
- Is primary topic of
- Path-based strong component algorithm
- Label
- enPath-based strong component algorithm
- Link from a Wikipage to an external page
- digital.library.wisc.edu/1793/57514
- www.cs.princeton.edu/courses/archive/spr04/cos423/handouts/path%20based...pdf
- Link from a Wikipage to another Wikipage
- Algorithmica
- Array (data type)
- Category:Graph algorithms
- Category:Graph connectivity
- Depth-first search
- Directed graph
- Graph theory
- Linear time
- Stack (data structure)
- Strongly connected component
- Tarjan's strongly connected components algorithm
- SameAs
- 4tGuX
- m.02w1y2y
- Path-based strong component algorithm
- Q7144620
- Алгоритам за налажење компоненти повезаности
- Алгоритм поиска компонент сильной связности с двумя стеками
- الگوریتم مؤلفه قوی مبتنی بر مسیر
- Subject
- Category:Graph algorithms
- Category:Graph connectivity
- WasDerivedFrom
- Path-based strong component algorithm?oldid=1117486237&ns=0
- WikiPageLength
- 4978
- Wikipage page ID
- 12377419
- Wikipage revision ID
- 1117486237
- WikiPageUsesTemplate
- Template:Citation
- Template:Harvtxt
- Template:Reflist