Changes between Version 9 and Version 11 of Ticket #12385


Ignore:
Timestamp:
01/31/12 06:12:53 (10 years ago)
Author:
kini
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #12385 – Description

    v9 v11  
    1414Another possibility would be to use the definition found on Wikipedia, namely that a simple path must not have ''any'' repeated vertices, and that a "simple cycle" is a path whose first vertex is its last vertex but has no other vertex repetitions. In this case the function should exclude both paths of the form `[a, b, c, b]` and paths of the form `[b, c, b]`. But I don't see that this is very useful. The function allows you to specify sets of starting and ending points for the paths you want returned, and if you specify non-disjoint sets, you are likely asking for cycles to be included.
    1515
     16Incidentally, a definition that matches what is given in the first paragraph above is this: a "simple path" in a directed graph is a sequence of arcs such that the head of each arc is the tail of the next arc in the sequence, and no two arcs share the same head or the same tail.
     17
    1618----
    1719