Using the Breath-First-Search (BFS) algorithm, how many nodes have a distance of 1, 2 and 3 from node A, respectively?
b) 3, 3, 3
c) 3, 4, 2
d) 2, 3, 4
e) None of the above.
Original idea by: Matheus de Oliveira Saldanha
Subscribe to:
Post Comments (Atom)
2026-318
Suppose a graph \(G\) has the following second power of the adjacency matrix: $$ A^2 = \left( \begin{array}{cccc}1 & 0 & 1 & 1\...
No comments:
Post a Comment