Ok...
here is the rough idea.
Since the two X's in two different sequences are treated as different X's, i
guess you subscript it with the sequence no as in Xa and Xb etc.
This needs to be done only with nodes that occur in a cycle. That cycle can
be removed if we consider the two Xs as differen
i am sry... i meant topological sort n not search.
and i think tht shud be the solution to ur problem.
i will try n post the solution asap.
bbye
On 5/30/07, Edward <[EMAIL PROTECTED]> wrote:
>
>
> I'm not sure what a topological search is, I understand a topological
> sort.
>
> AFAIK a topologi
I'm not sure what a topological search is, I understand a topological
sort.
AFAIK a topological sort is not a solution to my problem since it does
not work if there are cycles.
I'm not sure how I can be clearer with the problem, I can give another
example.
Given one sequence where
a) V ->
Hi
you problem is not very clear. But as far as i get it, it is somewhat like
topological search.
jus see what toplogical search is and chk if tht is wat u want.
if not plz give a clearer picture of the prob.
all the best
bbye
On 5/30/07, Edward <[EMAIL PROTECTED]> wrote:
>
>
> I'm afraid I
