Changes between Initial Version and Version 1 of Ticket #19197, comment 20
 Timestamp:
 09/16/15 20:07:11 (5 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #19197, comment 20
initial v1 3 3 Let us say that you have a path of length 10 on {0,1,...,9}, and that you add a path of length 3 from 0 to 1, i.e. {0,a,1}. 4 4 5 If you want all vertices at distance 2 through a DFS starting from 0, you may discover afirst (at distance 1) then 1 (at distance 2). You will not explore 2 (because it would be a distance 3).5 If you want all vertices at distance 2 through a DFS starting from 0, you may discover 'a' first (at distance 1) then 1 (at distance 2). You will not explore 2 (because it would be a distance 3). 6 6 7 7 When next you will test edge (0,1) and rediscover 1 (this time at distance 1), you will stop there because '1' has already been discovered.