graph theory question

I need to translate the procedure (informally defined) found at
http://www.flosoft-systems.com/flosoft_systems_community/blogs/aryeh/RCS.php.

Currently I am making the following assumptions about the graph's
structure:

1. Contributors (except for dependent projects) are connected by a
weighted edge (their "RCS value) coming from the project

2. The graph can can be split such that each sub graph is a project
without reference to any other projects (i.e. the total weight of the
edges within the subgraph = the non-dependent project RCS)

3. If all such subgraphs are collapsed to a single vertix the only
connections left would be between projects

For the time being I am just attempting to visualize stuff and later
will worry about what algorithms to use to manage the actual payouts

.