|
|
|
|
|
Kengo Nakamura and Kunihiko Sadakane
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in ??(??+??)
O
(
n
+
m
)
time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G ...
ver más
|
|
|
|
|