| Class | Description |
|---|---|
| FloodingMaster |
This class defines the behaviour of the layout phase of the algorithm, loading the appropriate computations at the right time.
|
| FloodingMaster.DrawingBoundariesExplorer |
In this computation each vertex simply aggregates its coordinates to the max and min coodinates aggregator of its component.
|
| FloodingMaster.DrawingBoundariesExplorer.DrawingBoundariesExplorerWithComponentsNo | |
| FloodingMaster.DrawingScaler |
This computation applies a previously computed transformation stored into an aggregator (scaling+translation) to components' vertices.
|
| FloodingMaster.LayoutCCs |
Given the scaling and traslating data computed to arrange the connected components, this computation applies them to each vertex.
|
| GraphReintegration |
This class holds the computations and support methods needed to reintegrate the previously pruned one degree vertices into the graph.
|
| GraphReintegration.ConeReintegrateOneEdges |
This class places the one degree vertices in a cone.
|
| GraphReintegration.FairShareReintegrateOneEdges |
This class fairly distributes the one degree vertices of each vertex arranging them in the angles formed by the
vertex neighbors.
|
| GraphReintegration.MaxSlopeReintegrateOneDegrees |
This class reintegrates all the one degree vertices of a vertex in the widest angle formed by its neighbors.
|
| GraphReintegration.PlainDummyComputation |
A plain dummy computation used to propagate the vertices reintegration.
|
| GraphReintegration.PlainGraphReintegration |
Abstract class that holds base methods to reintegrate the vertices.
|
| GraphReintegration.RadialReintegrateOneEdges |
This reintegration method simply arranges the one degree vertices around their neighbor.
|
| Propagator |
The propagator class works as follows.
|
| Seeder |
The seeding class works as follows.
|