Hi -
You want to linearise a dependency graph. The standard way to do this is to
do a depth first search on the graph and output the nodes in reverse order
of their finishing times (although your example looks like you want them in
the reverse order, that is starting with the node on which nothing
Tom Jones wrote:
> Hi,
>
> Consider tuples of the above numbers in the form:
>(a,b)
>
> Suppose this relation means:
>a depends on b
>
> Given a list of tuples, I would like an algorithm to return the proper
> ordering of the elements...and if the ordering has a loop (which in this
> case
Tom Jones schrieb:
> Hi,
>
> Consider tuples of the above numbers in the form:
> (a,b)
>
> Suppose this relation means:
> a depends on b
>
> Given a list of tuples, I would like an algorithm to return the proper
> ordering of the elements...and if the ordering has a loop (which in this
> c
Tom Jones wrote:
> Hi,
>
> Consider tuples of the above numbers in the form:
>(a,b)
>
> Suppose this relation means:
>a depends on b
>
> Given a list of tuples, I would like an algorithm to return the proper
> ordering of the elements...and if the ordering has a loop (which in this
> c
