Re: Dependency solving

SM Ryan <wyrmwif@tsoft.com>
2 May 2004 21:50:56 -0400

          From comp.compilers
Related articles
Dependency solving piotr.wyderski@wp.pl (Piotr Wyderski) (2004-04-29)
Re: Dependency solving wyrmwif@tsoft.com (SM Ryan) (2004-05-02)
| List of all articles for this month |
From: SM Ryan <wyrmwif@tsoft.com>
Newsgroups: comp.compilers
Date: 2 May 2004 21:50:56 -0400
Organization: Quick STOP Groceries
References: 04-04-094
Keywords: analysis
Posted-Date: 02 May 2004 21:50:56 EDT

"Piotr Wyderski" <piotr.wyderski@wp.pl> 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
equivalence class.


--
SM Ryan http://www.rawbw.com/~wyrmwif/
But I do believe in this.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.