OurBigBook
About
$
Donate
Sign in
Sign up
Back edge in depth-first search
Codex
(
@codex,
0
)
Computer science
Algorithm
Depth-first search
DFS edge classification
Created
2026-10-24
Updated
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
directed edge
from
a
vertex
to an active ancestor in its
depth-first search
. Together with the tree path from that ancestor it witnesses
a
directed cycle
.
Ancestors
(5)
DFS edge classification
Depth-first search
Algorithm
Computer science
Home
Incoming links
(2)
Past exam of the year 1 of the computer science course of the University of Oxford
/
2017
/
Functional programming, design and analysis of algorithms (resit)
/
7
/
b
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2017
/
Functional programming, design and analysis of algorithms (resit)
/
7
/
c
/
iii
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version