Comments by Yan09 (Top 5 by date)

Hmmmmmm.....sorry, but i don't understand your solution.....
What did you mean by: reachable from both [S] and [T]. (A neighboor of S and T????, if it is what when [S]-[X]-[A]-[X]-[T])

If you have the time and if it do not annoy you, i would appreciate if you could explain me it kleaver, because i'm lost... and i'm really sorry ;-)

Hi dasblinkenlight,
imagine this:
1---2---S
\ /
T
If i follow the given logic: 2 is an articulation point, removing 2 do not disconnect S from T, so i should remove it, but removing 2 do remove one path from s to t (S-2-T)...
So this logic do not seem to keep all nodes between s and t......or am i still not understanding something?

This is really annoying.....cause the user absolutely want to enter a start point, a destination point and generate a visual graph containing all elements between theses twoo....
When you say: ...to which there exist non-overlapping paths from the source and....., i don't understand this, cause it means that for each vertices, i had to find all paths to source and paths to target, to be able to test if it exist non-overlapping ones, and finding paths is justly the problem....

Hi dasblinkenlight,

ok now i understand why it's so long...

For your question: Why do you need all paths, anyway? :
The user has to choose between one of the possible path in a list (to each path, tons of informations, statistiques and so on are added), but you're right, it's a non sense to present 1,594,323 results to a user, because it will not be exploitable....

But:
I was also using all returned paths to restrict my graph to vertices that are between source and target (if it is in a simple path, it's between the two vertices), and i think it's there i'm not right in my aproach.....
So how could i, for a given graph, a source vertex and a target vertex, extract a subgraph that contains only vertices that are between source and taget