| Home | Trees | Indices | Help |
|
|---|
|
|
Critical path algorithms and transitivity detection algorithm.
| Functions | |||
| List |
|
||
| List |
|
||
| Variables | |
__package__ =
|
|
| Function Details |
Compute and return the critical path in an acyclic directed weighted graph.
Attention: This function is only meaningful for directed weighted acyclic graphs |
Return a list of transitive edges. Example of transitivity within graphs: A -> B, B -> C, A -> C in this case the transitive edge is: A -> C
Attention: This function is only meaningful for directed acyclic graphs. |
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Sat Aug 25 09:56:10 2012 | http://epydoc.sourceforge.net |