|Dependency solving firstname.lastname@example.org (Piotr Wyderski) (2004-04-29)|
|Re: Dependency solving email@example.com (SM Ryan) (2004-05-02)|
|From:||SM Ryan <firstname.lastname@example.org>|
|Date:||2 May 2004 21:50:56 -0400|
|Organization:||Quick STOP Groceries|
|Posted-Date:||02 May 2004 21:50:56 EDT|
"Piotr Wyderski" <email@example.com> wrote:
# How are cyclic dependencies solved in object-oriented languages?
# Say, we have a class (in a C++-like language):
One way of dealing with cyclic relations is to create a graph, use
Tarjan's strongly-connected-component algorithm to find an acyclic
factorred graph, use tsort to traverse the factorred graph; then
depending on the nature of the relation, each SCC might be an
SM Ryan http://www.rawbw.com/~wyrmwif/
But I do believe in this.
Return to the
Search the comp.compilers archives again.