Trees | Indices | Help |
|
---|
|
Reads vcg buffer and creates the graph using Immunity Debugger lib
(c) Immunity, Inc. 2004-2007
|
|||
graphTree | |||
ParseVCGList recursive VCG parser |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
__VERSION__ = '1.2' NOTES: need to divide graph in layers save max layer in graph every set of childs [unique and different part vertex] E a different layer save vertex of layer in each layer mark blank path points in each layer [i preffer path points to dummy vertices] |
|||
PALETTE = []
|
|
Note: needs to divide graph in layers Draft notes: step 1 get temptative coords to place vertex step 2 check if coords overlaps already placed vertex step 2 a) first we have to check if (y,y2) of vertex is in range of the placed vertex, if y >= yp and y <= y2p or y2 >= yp and y2 <= y2p: if that condition is true, means we have a vertex in the same y that an already placed vertex, so it might be possible of an overlapping to exists, so we are going to ask: if x >= xp and x <= x2p: if that condition is true, then we have an overlapping over the y coord of the vertex (left point) if x2 >= xp and x <= x2p: if that condition is true, then we have an overlapping over the y coord of the vertex (right point) and if does, check whether x or x2 is overlapping once we know that, we need to check wheter x or x2 of overlapped vertex is touched if x , move west x - 10 and recheck |
Note: needs to divide graph in layers Draft notes: step 1 get temptative coords to place vertex step 2 check if coords overlaps already placed vertex step 2 a) first we have to check if (y,y2) of vertex is in range of the placed vertex, if y >= yp and y <= y2p or y2 >= yp and y2 <= y2p: if that condition is true, means we have a vertex in the same y that an already placed vertex, so it might be possible of an overlapping to exists, so we are going to ask: if x >= xp and x <= x2p: if that condition is true, then we have an overlapping over the y coord of the vertex (left point) if x2 >= xp and x <= x2p: if that condition is true, then we have an overlapping over the y coord of the vertex (right point) and if does, check whether x or x2 is overlapping once we know that, we need to check wheter x or x2 of overlapped vertex is touched if x , move west x - 10 and recheck |
|
__VERSION__NOTES: need to divide graph in layers save max layer in graph every set of childs [unique and different part vertex] E a different layer save vertex of layer in each layer mark blank path points in each layer [i preffer path points to dummy vertices] for layer in layers: move east and west vertices, depending on their type * pathfinder(graph) search empy spots where edge lines might travel a cool thing might be mark the whole graph as east-slanted or west-slanted, according the graph the n east or n west it will move if the graph is slanting too much to east from center point, we can start thinking on going west that can be too fuzzy, but will try to make an aproach for human eye new lib against old lib: orphan vertices from old lib has been solved, now every vertex has at least 1 relationship saved parent<->child type of vertex are correctly relationed now
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Mar 17 18:43:02 2011 | http://epydoc.sourceforge.net |