Packagecom.yworks.yfiles.layout.planar
Classpublic class IntDSP
InheritanceIntDSP Inheritance YObject Inheritance Object

An implementation of the Dijkstra Shortest Path Algorithm for weighted graphs. This algorithm can't handle negative edge weights.


Public Methods
 MethodDefined By
  
IntDSP(init:Boolean = true)
IntDSP
  
dispose():void
IntDSP
 Inherited
equals(o:Object):Boolean
YObject
  
getClass():Class
[override]
IntDSP
 Inherited
hashCode():int
YObject
  
init(_graph:Graph):void
IntDSP
  
newIntDSP():IntDSP
[static]
IntDSP
  
start(start:Node, end:Node, weightData:DataProvider):EdgeList
IntDSP
Protected Methods
 MethodDefined By
  
initIntDSP():void
Initializes this object.
IntDSP
Constructor Detail
IntDSP()Constructor
public function IntDSP(init:Boolean = true)

Parameters
init:Boolean (default = true) — An internally used switch to help handle proper instance initialization in inheritance chains where classes can have multiple constructor-like factory methods. This parameter can safely be ignored/omitted when calling the constructor.
Method Detail
dispose()method
public function dispose():void

getClass()method 
override public function getClass():Class

Returns
Class
init()method 
public function init(_graph:Graph):void

Parameters

_graph:Graph

initIntDSP()method 
protected final function initIntDSP():void

Initializes this object. See the documentation of the corresponding factory method newIntDSP() for details.

See also

newIntDSP()
newIntDSP()method 
public static function newIntDSP():IntDSP

Returns
IntDSP
start()method 
public function start(start:Node, end:Node, weightData:DataProvider):EdgeList

Parameters

start:Node
 
end:Node
 
weightData:DataProvider

Returns
EdgeList




Wed Oct 7 2015, 04:43 PM +02:00