This class implements a powerful planar-subgraph heuristic.
The heuristic is an extension of the Goldschmidt/Takvorian Algorithm which is described in Eiglsperger/Kaufmann.
protected var _hiddenEdges:EdgeListallowRandomization:Boolean
Specifies if the algorithm will use randomization to improve the result.
Implementation public function get allowRandomization():Boolean public function set allowRandomization(value:Boolean):voidprotected var edgeListComparator:GT_EdgeListComparatorprotected var globalSink:Nodeprotected var globalSource:Nodeprotected var graph:GraphhiddenEdges:EdgeList [read-only]
Returns a list of the edges that have been removed in order to gain a planarization of the input graph.
The createPlanarization method of this class must have been called earlier to compute the list of hidden edges. If not so, a runtime exception is thrown!
Implementation public function get hiddenEdges():EdgeList Throws | Error — if createPlanarization has not been called prior to calling this method.
|
See also
protected var isValid:Booleaniterations:int
Specifies number of iterations when randomization is used.
Implementation public function get iterations():int public function set iterations(value:int):voidprotected var mis1Comparator:GT_MIS1Comparatorprotected var mis2Comparator:GT_MIS2Comparatorprotected var outerFaceDeterminationEdge:Edgeprotected var outerFaceDeterminationNode:Nodeprotected var planar:PlanarInformationsink:Node [read-only]
Returns the sink of the st-graph.
Implementation public function get sink():Nodesource:Node [read-only]
Returns the source of the st-graph.
Implementation public function get source():Nodeprotected var vertexOrder:VertexOrderprotected var weight:EdgeMappublic function GT(init:Boolean = true)
Returns a new instance of GT.
Parameters | init:Boolean (default = true) |
protected function calcMISIncidents(MIS:EdgeList, MISIncidents:NodeMap):void
Calculates form the independent set of edges, the edges incident to an node which are inside this independent set.
Parameters
protected function calcOrdering(orderNumbers:Vector.<int>, mis:OverlapGraphMIS):NodeList
Parameters
Returns protected function createCircularEdgeOrder(MIS1:EdgeList, MIS2:EdgeList, downwardLink:NodeMap, upwardLink:NodeMap, orderNumbers:Vector.<int>):void
this method sorts each nodes incident edges according to the aim of yielding a planar embedding for a subgraph of the input graph It also assigns first incoming/outgoing.
Parameters
public function createPlanarization(p:PlanarInformation):void
This method planarizes a graph by finding (a maximum) planar sub- graph.
To gain a planar graph, sometimes some edges have to be removed in order to prevent crossings. The removed edges are returned by the method getHiddenEdges() below. A circular edge order is also computed. Note: the input graph is modified
Parameters
protected function createReverseEdges():void public function dispose():void
Cleaning up resources.
override public function getClass():ClassReturns protected final function initGT():void
Initializes this object. See the documentation of the corresponding factory method newGT() for details.
See also
protected function initOrdering(downwardLink:NodeMap, upwardLink:NodeMap, orderedNodes:NodeList):void
Initializes data structures from an ordering.
Parameters
public static function newGT():GT
Returns a new instance of GT.
Returns protected function showEdgePartitionResult(MIS1:ArrayList, MIS2:ArrayList):void Parameters
protected function showGraphicDebug(MIS1:EdgeList, MIS2:EdgeList, orderNumbers:Vector.<int>):void Parameters
protected function showIncidentEdges(MIS1Incidents:NodeMap, MIS2Incidents:NodeMap, downwardLink:EdgeMap, upwardLink:EdgeMap):void Parameters
protected function showVertexOrder(orderNumbers:Vector.<int>):void Parameters
| orderNumbers:Vector.<int> |
Wed Oct 7 2015, 04:43 PM +02:00 
YObject 
Hide Inherited Public Methods
Show Inherited Public Methods