-
ComputeDepth()
- Dfs function
-
ComputeFatherAndSonNum()
- Dfs function
-
DFS()
- Performs a generic (recursive) DFS on the dag.
-
DagVertexComp()
- Compare two vertices.
-
DagVertexHash()
- Calculate the hash key of a vertex.
-
DagVertexInit()
- Vertex initialization.
-
Dag_Dfs()
- Performs a generic DFS on the dag.
-
Dag_ManagerAlloc()
- Creates a new DAG manager.
-
Dag_ManagerFree()
- Deallocates a DAG manager.
-
Dag_ManagerGC()
- Garbage collects the DAG manager.
-
Dag_PrintStats()
- Prints various statistics.
-
Dag_VertexInsert()
- Vertex insert.
-
Dag_VertexLookup()
- Vertex lookup.
-
Dag_VertexMark()
- Marks a vertex as permanent.
-
Dag_VertexUnmark()
- Unmarks a vertex (makes it volatile).
-
GC()
- Depth-first garbage collection.
-
PrintStat()
- Visit a DAG to compute some statistics
-
ResetStat()
- Reset the statistics data
-
_PrintStat()
- Print out the number of nodes by degree and depth
-
clean_first()
- Dfs FirstVisit for cleaning.
-
doNothingAndReturnVoid()
- Dfs function doing nothing
-
doNothingAndReturnZero()
- Dfs function returning zero
-
do_nothing()
- Dfs Back & Last visit for cleaning.
-
return_zero()
- Dfs SetVisit for cleaning.
-
()
- Check if a vertex is a leaf
-
()
- Clears (forces) a bit annotation to 0.
-
()
- Controls the sign of a dag.
-
()
- Filters a pointer from bit annotations.
-
()
- Makes the code more readable
-
()
- Performs a generic, iterative, DFS on the dag.
-
()
- Sets (forces) a bit annotation to 1.
-
()
- Tests if the edge is annotated.
Last updated on 2012/11/18 14h:37