Uses of Class
openlist.examples.WeightedDirectedGraph.Node

Packages that use WeightedDirectedGraph.Node

openlist.examples

Example program(s) using OpenList.

Uses of WeightedDirectedGraph.Node in openlist.examples

Fields in openlist.examples declared as WeightedDirectedGraph.Node

(package private) WeightedDirectedGraph.Node	WeightedDirectedGraph.Node.predecessor the predecessor of this Node on the shortest path from the source
(package private) WeightedDirectedGraph.Node	WeightedDirectedGraph.Arc.target

Fields in openlist.examples with type parameters of type WeightedDirectedGraph.Node

(package private) java.util.LinkedList<WeightedDirectedGraph.Node>	WeightedDirectedGraph.activeNodes a LinkedList of the active nodes during execution of Dijkstra's algorithm This list will be initialized as a clone of nodes, and retired nodes removed from it.
(package private) java.util.LinkedList<WeightedDirectedGraph.Node>	WeightedDirectedGraph.nodes a LinkedList of the nodes in the graph in internal form

Methods in openlist.examples that return WeightedDirectedGraph.Node

(package private) WeightedDirectedGraph.Node	WeightedDirectedGraph.findByName(Symbol symbol) Find a Node by name in the LinkedList of nodes.
(package private) WeightedDirectedGraph.Node	WeightedDirectedGraph.findSmallestActiveNode() Find the active node with the smallest distance, and make it inactive.

Constructors in openlist.examples with parameters of type WeightedDirectedGraph.Node

WeightedDirectedGraph.Arc(WeightedDirectedGraph.Node target, long weight)
Construct an Arc.