Given the following undirected graph G = (V, E). Using vertex s as the source vertex.
If multiple neighbors are available, visit them using alphabetical order.
Asked
Active
Viewed 43 times
0
Jane_IDK
- 65
- 7
-
And what's your question about this? – Nico Haase Nov 10 '21 at 12:14
-
@NicoHaase I don't know hou to find out the low value of each node, thank you. – Jane_IDK Nov 10 '21 at 12:20
-
Please add all clarification to your question by editing it. Also, please share how this is related to programming – Nico Haase Nov 10 '21 at 12:26
-
**_I don't know hou to find out the low value of each node_** what do you mean by low value of each node ? Please [edit] the post and clarify your question. – c0der Nov 11 '21 at 08:00