Changes between Initial Version and Version 1 of Ticket #19197, comment 20


Ignore:
Timestamp:
09/16/15 20:07:11 (4 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #19197, comment 20

    initial v1  
    33Let 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}.
    44
    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).
     5If 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).
    66
    77When next you will test edge (0,1) and re-discover 1 (this time at distance 1), you will stop there because '1' has already been discovered.