Edit D:\app\Administrator\product\11.2.0\dbhome_1\md\jlib\oracle\spatial\network\Dijkstra.class
?? 1? ?]^ ?_ ?`a bcdef ] ghihjk ?l m n o ~np ~qrds tu v??? ?w ?x ?y ?z ] {d|d}~~? ? ?? ? ?? ??? +???????d? ? ? +? ?? ?? ??? 6? ~?????? ;? ;?? >? >? ? ?? ?? >? >? ? ;{ ;? ;? ????? ??? P]?n ??? V? V??? N? ??? \? P?? _] _n _??? ? P? _?d? ? 6? ?? ? ??? m]? m? m? m? ?????? ;?? m? \?? ? ~] ? ~? ? ~? ? ~? ??? ?? ?? ?? ?? ?? ?? ? ~? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ?? ??? ?] ??d????? ????d? ?? ? ?? ?d? ??? ?? ?? ?? ?? ???? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? ! " ?# ?$% ?& ?'() ?*+ 6, ?-. ?/ ?0 ?12 ?3 4 5 ;6 _? _b ?3 78 9:;< ?= 6> ??@ ?ABC INFINITY D ConstantValue <init> ()V Code LineNumberTable shortestPaths k(Loracle/spatial/network/Network;ILoracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; Exceptions l(Loracle/spatial/network/Network;I[Loracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; shortestReachingPaths findParentTable b(Loracle/spatial/network/Network;ILoracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; c(Loracle/spatial/network/Network;IILoracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; c(Loracle/spatial/network/Network;I[Loracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; d(Loracle/spatial/network/Network;II[Loracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; d(Loracle/spatial/network/Network;I[Loracle/spatial/network/NetworkConstraint;I)Ljava/util/Hashtable; ?(Loracle/spatial/network/Network;I[Loracle/spatial/network/NetworkConstraint;ILoracle/spatial/network/GoalNode;)Ljava/util/Hashtable; d(Loracle/spatial/network/Network;I[ILoracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; e(Loracle/spatial/network/Network;I[I[Loracle/spatial/network/NetworkConstraint;)Ljava/util/Hashtable; findReachingParentTable printNodeTable 5(Loracle/spatial/network/Node;Ljava/util/Hashtable;)V printLinkTable printCostTable getDepth R(Loracle/spatial/network/Node;Loracle/spatial/network/Node;Ljava/util/Hashtable;)I getPathDepth 5(Loracle/spatial/network/Node;Ljava/util/Hashtable;)I setPathDepth 6(Loracle/spatial/network/Node;Ljava/util/Hashtable;I)V getPathCost 5(Loracle/spatial/network/Node;Ljava/util/Hashtable;)D setPathDuration 6(Loracle/spatial/network/Node;Ljava/util/Hashtable;D)V setPathCost getPathDuration getPathLinkVec c(Ljava/util/Hashtable;Loracle/spatial/network/Node;Loracle/spatial/network/Node;)Ljava/util/Vector; getPathNodeVec A(Loracle/spatial/network/Network;I)[Loracle/spatial/network/Path; withinDistance l(Loracle/spatial/network/Network;IDLoracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; B(Loracle/spatial/network/Network;ID)[Loracle/spatial/network/Path; =(Loracle/spatial/network/Node;)[Loracle/spatial/network/Path; g(Loracle/spatial/network/Node;Loracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; withinCost >(Loracle/spatial/network/Node;D)[Loracle/spatial/network/Path; withinReachingCost nearestNeighbors >(Loracle/spatial/network/Node;I)[Loracle/spatial/network/Path; l(Loracle/spatial/network/Network;IILoracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; ?(Loracle/spatial/network/Network;IILoracle/spatial/network/NetworkConstraint;Loracle/spatial/network/GoalNode;)[Loracle/spatial/network/Path; ?(Loracle/spatial/network/Network;II[Loracle/spatial/network/NetworkConstraint;Loracle/spatial/network/GoalNode;)[Loracle/spatial/network/Path; B(Loracle/spatial/network/Network;II)[Loracle/spatial/network/Path; nearestNeighbor @(Loracle/spatial/network/Network;I)Loracle/spatial/network/Path; <(Loracle/spatial/network/Node;)Loracle/spatial/network/Path; nearestReachingNeighbors c(Loracle/spatial/network/Network;IILoracle/spatial/network/GoalNode;)[Loracle/spatial/network/Path; shortestPath Y(Loracle/spatial/network/Node;Loracle/spatial/network/Node;)Loracle/spatial/network/Path; ?(Loracle/spatial/network/Node;Loracle/spatial/network/Node;Loracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Path; k(Loracle/spatial/network/Network;IILoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Path; l(Loracle/spatial/network/Network;II[Loracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Path; p(Loracle/spatial/network/Network;IDIDLoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/SubPath; o(Loracle/spatial/network/Network;IDILoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/SubPath; o(Loracle/spatial/network/Network;IIDLoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/SubPath;Q(Loracle/spatial/network/Network;Loracle/spatial/network/Node;Loracle/spatial/network/Link;Loracle/spatial/network/Link;Loracle/spatial/network/Link;Loracle/spatial/network/Node;Loracle/spatial/network/Link;Loracle/spatial/network/Link;Loracle/spatial/network/Link;Loracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Path; shortestPathNonTemp A(Loracle/spatial/network/Network;II)Loracle/spatial/network/Path; ?(Loracle/spatial/network/Node;[Loracle/spatial/network/Node;Loracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/Path; tracePath n(Ljava/util/Hashtable;Loracle/spatial/network/Node;Loracle/spatial/network/Node;)Loracle/spatial/network/Path; ?(Ljava/util/Hashtable;Loracle/spatial/network/Node;Loracle/spatial/network/Node;Loracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Path; traceReachingPath farthestShortestPath Z(Loracle/spatial/network/Node;[Loracle/spatial/network/Node;)Loracle/spatial/network/Path; N(Loracle/spatial/network/Node;Ljava/util/Vector;)Loracle/spatial/network/Path; traceOutTree k(Loracle/spatial/network/Network;IDLoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Tree; traceOut o(Loracle/spatial/network/Network;IDLoracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/SubPath; l(Loracle/spatial/network/Network;IDDLoracle/spatial/network/NetworkConstraint;)Loracle/spatial/network/Tree; p(Loracle/spatial/network/Network;IDDLoracle/spatial/network/NetworkConstraint;)[Loracle/spatial/network/SubPath; traceInTree traceIn addSubPathToTree A(Loracle/spatial/network/Tree;Loracle/spatial/network/SubPath;Z)V traceOutSubPath traceInSubPath SourceFile Dijkstra.java (oracle/spatial/network/NetworkConstraint NODEDE java/util/HashtableFGH $oracle/spatial/network/PriorityQueueIJKLMNO oracle/spatial/network/NodeHIPQRSTU oracle/spatial/network/PathVW [Loracle/spatial/network/Path;XSYZ java/lang/Exception[KI\M]M^_`abcbde#"fe!" oracle/spatial/network/CostNodeghMiMjkGl $ oracle/spatial/network/NodeImplmUnopqMrO oracle/spatial/network/Linksltl 'oracle/spatial/network/AnalysisInfoImpluvwxM%&'&yz{z|}~ LINK COST DURATION oracle/spatial/network/GoalNode java/util/HashSet? java/lang/Double?ew???? java/lang/IntegerZ java/util/HashMap????S???S?U????? java/lang/StringBuilder StartNode:?????b??? Node: -> P Node: -> P Link: -> Cost: ???S java/util/Vector?????????? 'oracle/spatial/network/SystemConstraint??w)*(.+?w??.* 0*1614151378:;:4<F<? oracle/spatial/network/NDMTimer ?? +oracle/spatial/network/NetworkDataException shortestPath start link: or end link: not found!? 2shortestPath start percentage information invalid! 0shortestPath end percentage information invalid!??<D?S????M?Z?? shortestPath end link: oracle/spatial/network/PathImpl?????????? shortestPath start node of link: or end node of link:-HJ?=KJG, Farthest Shortest Path: N[ ]: [ ]: ??L9 [Loracle/spatial/network/Node;LM oracle/spatial/network/TreeYR TraceOutSubPath???????WX ![Loracle/spatial/network/SubPath;YT??ZR??ZT??????????e?e?????????????????? "oracle/spatial/network/NetworkImpl?M???Z "oracle/spatial/network/SubPathImpl??????M?? oracle/spatial/network/SubPath??? traceOut start link : .traceOut start percentage information invalid!?w?? traceOut end link : ,traceOut end percentage information invalid!?w oracle/spatial/network/Dijkstra java/lang/Object get &(Ljava/lang/Object;)Ljava/lang/Object; oracle/spatial/network/Network getNode (I)Loracle/spatial/network/Node; keys ()Ljava/util/Enumeration; java/util/Enumeration hasMoreElements ()Z nextElement ()Ljava/lang/Object; insert (Ljava/lang/Comparable;)V size ()I toVector ()Ljava/util/Vector; toArray (([Ljava/lang/Object;)[Ljava/lang/Object; getMaxPathID setID (I)V printStackTrace getState hasNodeCost getMetadata *()Loracle/spatial/network/NetworkMetadata; &oracle/spatial/network/NetworkMetadata getLinkDurationColumn ()Ljava/lang/String; getNodeDurationColumn getCost ()D getDuration !(Loracle/spatial/network/Node;D)V isDirected isEmpty deleteMin ()Ljava/lang/Comparable; ()Loracle/spatial/network/Node; getNextLinkVector iterator ()Ljava/util/Iterator; java/util/Iterator hasNext next getStartNode getEndNode ?(Loracle/spatial/network/Node;Loracle/spatial/network/Node;Loracle/spatial/network/Node;Loracle/spatial/network/Link;Loracle/spatial/network/Link;IDLjava/util/Vector;Ljava/util/Vector;)V setCurrentDuration (D)V requiresPathLinks setPathLinkVec (Ljava/util/Vector;)V setPathNodeVec isSatisfied ((Loracle/spatial/network/AnalysisInfo;)Z put 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; java/util/Set doubleValue add (Ljava/lang/Object;)Z isGoal (Loracle/spatial/network/Node;)Z values ()Ljava/util/Collection; java/util/Collection getID contains getNoOfNodes getPrevLinkVector keySet ()Ljava/util/Set; java/lang/System out Ljava/io/PrintStream; append -(Ljava/lang/String;)Ljava/lang/StringBuilder; (I)Ljava/lang/StringBuilder; toString java/io/PrintStream println (Ljava/lang/String;)V (D)Ljava/lang/StringBuilder; intValue getNetwork "()Loracle/spatial/network/Network; elementAt (I)Ljava/lang/Object; findLinks =(Loracle/spatial/network/Node;)[Loracle/spatial/network/Link; containsKey insertElementAt (Ljava/lang/Object;I)V #(Loracle/spatial/network/Network;)V setMaxDistance setMaxCost addElement (Ljava/lang/Object;)V getLink (I)Loracle/spatial/network/Link; addTemporaryNode =(Loracle/spatial/network/Link;D)Loracle/spatial/network/Node; getNoOfLinks %oracle/spatial/network/NetworkFactory createSubPath C(Loracle/spatial/network/Path;IDID)Loracle/spatial/network/SubPath; isTemporary deleteNode getLinkAt removeLink (Loracle/spatial/network/Link;)V setStartNode (Loracle/spatial/network/Node;)V insertLink setEndNode appendLink createPath print oracle/spatial/network/OraTst $([Loracle/spatial/network/SubPath;)V createTreeNode @(Loracle/spatial/network/Node;)Loracle/spatial/network/TreeNode; createTree @(Loracle/spatial/network/TreeNode;)Loracle/spatial/network/Tree; A(Loracle/spatial/network/Link;D)Loracle/spatial/network/TreeNode; A(Loracle/spatial/network/TreeNode;Z)Loracle/spatial/network/Tree; getRootNode #()Loracle/spatial/network/TreeNode; oracle/spatial/network/TreeNode getReferencePath ()Loracle/spatial/network/Path; getNodeArray ()[Loracle/spatial/network/Node; getLinkArray ()[Loracle/spatial/network/Link; getStartPercentage getEndPercentage getChildNodeArray $()[Loracle/spatial/network/TreeNode; createTreeLink @(Loracle/spatial/network/Link;)Loracle/spatial/network/TreeLink; B(Loracle/spatial/network/Link;DD)Loracle/spatial/network/TreeLink; getTreeLink #()Loracle/spatial/network/TreeLink; ()Loracle/spatial/network/Link; equals addChildNode E(Loracle/spatial/network/TreeLink;Loracle/spatial/network/TreeNode;)V getNextLinks w(Loracle/spatial/network/Node;Loracle/spatial/network/Node;[Loracle/spatial/network/Link;)Loracle/spatial/network/Path; isTemporaryCachingEnabled addTemporatoryElement advanceMaxPathID (Loracle/spatial/network/Path;)V isLinkReversed (I)Z (Loracle/spatial/network/Link;)Z isUnidirected extendPath =(Loracle/spatial/network/Link;Loracle/spatial/network/Link;)V java/util/Arrays sort ([Ljava/lang/Object;)V setStartPercentage getPrevLinks setEndPercentage ? ? ? | M *? ? T >