[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Sheflug] Weird algorithm question
[25/06/10 16:57] Alex Hudson wrote:
> Thinking about this, there ought to be some MapReduce magic you could
> work here. If there are "loops" where you have start and end nodes with
> multiple "routes" between them but only two vertices per node, e.g.:
>
> --A--C--E--T--B--
> \----F--G----/
>
> .. then you can automatically throw away the A->F->G->B route because
> it's never going to be part of any longest route.
Actually I do want both A-F-G-B and A-C-E-T-B in the output, but not
shorter chains contained in them (so I don't want F-G-B and C-E-T, for
example).
_______________________________________________
Sheffield Linux User's Group
http://sheflug.org.uk/mailman/listinfo/sheflug_sheflug.org.uk
FAQ at: http://www.sheflug.org.uk/mailfaq.html
GNU - The Choice of a Complete Generation