When performing a depth-first search (DFS) on the following undirected graph with \(14\) vertices and \(32\) edges, how many back edges are obtained?
A. \(17\)
B. \(18\)
C. \(19\)
D. \(20\)
E. None of the above
Original idea by: Pedro Ferreira
Subscribe to:
Post Comments (Atom)
Kosaraju's distinct orders of SCC discovery
When performing Kosaraju’s algorithm on the directed graph shown below, in how many distinct orders can the strongly connected components be...
-
When performing Kosaraju’s algorithm on the directed graph shown below, in how many distinct orders can the strongly connected components be... -
Let \(A\) be the \(N \times N\) adjacency matrix of an undirected unweighted network, without self-loops. Let \(\mathbf{1}\) be a column ...
-
When performing a depth-first search (DFS) on the following undirected graph with \(14\) vertices and \(32\) edges, how many back edges are ...
No comments:
Post a Comment