Given the undirected graph bellow:
What is the distance from A to all nodes in this graph?
a) A - 0, B - 1, C - 2, D - 1, E - 2, F - 3, H - 4, G - 0
b) A - 0, B - 1, C - 2, D - 1, E - 2, F - 2, H - 3, G - 4
c) A - 0, B - 1, C - 2, D - 1, E - 2, F - 2, H - 3, G - unreachable
d) A - 0, B - 1, C - 2, D - 1, E - 2, F - 3, H - 2, G - unreachable
e) None of the above
Original idea by: João Augusto
No comments:
Post a Comment