Given the following undirected and unweighted graph:
What is the length of the shortest path between nodes 1 and 7?
- 3
- 4
- 5
- 6
- None of the above.
Original idea by: Pedro Henrique Di Francia Rosso
Subscribe to:
Post Comments (Atom)
2026-349
Prof. John was playing an RPG game with his students. He then shows this dice to them and says that it is a dodecahedron and we can represen...
No comments:
Post a Comment