Uses of Class
com.amalgamasimulation.graph.Graph.Node

Packages that use Graph.Node

Package	Description
com.amalgamasimulation.geometry
com.amalgamasimulation.graph
com.amalgamasimulation.graphagent
com.amalgamasimulation.trains

Uses of Graph.Node in com.amalgamasimulation.geometry

Methods in com.amalgamasimulation.geometry with parameters of type Graph.Node

Modifier and Type	Method	Description
static <N, A> void	GeometryUtil.groupAroundNode(Graph<N,A> graph, Graph<N,A>.Node groupingNode, double radius, Function<N,Point> pointExtractor, Function<A,Polyline> polylineExtractor, BiFunction<A,Polyline,A> newArcValueSupplier)	Deprecated.

Uses of Graph.Node in com.amalgamasimulation.graph

Fields in com.amalgamasimulation.graph declared as Graph.Node

Modifier and Type	Field	Description
protected Graph<N,A>.Node	Graph.Arc.dest
protected Graph<N,A>.Node	Graph.Arc.source

Fields in com.amalgamasimulation.graph with type parameters of type Graph.Node

Modifier and Type	Field	Description
protected List<Graph<N,A>.Node>	Graph.nodesList
protected Map<N,Graph<N,A>.Node>	Graph.valuesToNodes

Methods in com.amalgamasimulation.graph that return Graph.Node

Modifier and Type	Method	Description
Graph<N,A>.Node	Graph.addNode(N value)	Adds a node containing the specified value to the graph.
Graph<N,A>.Node	Graph.Arc.getDest()	Returns the destination node of the arc.
Graph<N,A>.Node	GraphPath.getFirstNode()	Returns the first node of this path.
Graph<N,A>.Node	GraphPath.getLastNode()	Returns the last node of this path.
Graph<N,A>.Node	Graph.getNode(N value)	Returns a graph node containing the specified value.
Graph<N,A>.Node	GraphPath.getNode(N value)	Returns a path node containing the specified value.
Graph<N,A>.Node	Graph.Arc.getSource()	Returns the source node of the arc.

Methods in com.amalgamasimulation.graph that return types with arguments of type Graph.Node

Modifier and Type	Method	Description
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> Pair<Set<Graph<A,B>.Node>,Set<Graph<A,B>.Arc>>	Algorithm.getInsignificantNodesAndArcs(Graph<A,B> graph, Set<Graph<A,B>.Node> significantNodes)	Returns the pair containing sets of insignificant nodes and arcs of the specified graph against the specified set of significant nodes.
static <A, B> Pair<Set<Graph<A,B>.Node>,Set<Graph<A,B>.Arc>>	Algorithm.getInsignificantNodesAndArcs(Graph<A,B> graph, Set<Graph<A,B>.Node> significantNodes, Set<Graph<A,B>.Arc> barrierArcs)	Returns the pair containing sets of insignificant nodes and arcs of the specified graph against the specified set of significant nodes.
List<Graph<N,A>.Node>	Graph.getNodes()	Returns unmodifiable list of all nodes in the graph.
List<Graph<N,A>.Node>	GraphPath.getNodes()	Returns an unmodifiable list of nodes of this path.
static <A, B> List<List<Graph<A,B>.Node>>	Algorithm.getTreeNodesByLevels(Graph<A,B> graph)	Groups the nodes of the specified oriented tree by levels.
static <A, B> Map<Graph<A,B>.Node,Integer>	Algorithm.topologicalSort(Graph<A,B> graph, Graph<A,B>.Node rootNode)	Performs topological sorting of the graph with respect to the specified root node and returns a map containing mapping from graph nodes to integer numbers.
static <A, B> Map<Graph<A,B>.Node,Integer>	Algorithm.topologicalSort(Graph<A,B> graph, List<Graph<A,B>.Node> rootNodes)	Performs topological sorting of the graph with respect to the specified root nodes and returns a map containing mapping from graph nodes to integer numbers.

Methods in com.amalgamasimulation.graph with parameters of type Graph.Node

Modifier and Type	Method	Description
GraphPath<N,A>	GraphPath.addNode(Graph<N,A>.Node node)	Adds the specified node to this path if this path is empty, otherwise throws a IllegalArgumentException.
C	Algorithm.GraphTraversalContextCalculator.calculateNextNodeContext(Graph<A,B>.Arc addedArc, Graph<A,B>.Node addedNode, Algorithm.ArcRelativeDirection addedArcDirection, C prevNodeContext)	Function answering the question "What must be the context of the node being added considering we know the added arc, the added node itself, and the context of the already traversed node adjacent to this arc?"
static <A, B> GraphPath<A,B>	Algorithm.calculateShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Calculates shortest path between the two specified nodes having data about nodes of the minimal spanning tree and arcs of the minimal spanning tree, i.e.
boolean	Algorithm.GraphTraversalPredicate.canAddArcAndNode(Graph<A,B>.Arc addedArc, Graph<A,B>.Node addedNode, Algorithm.ArcRelativeDirection addedArcDirection)	Predicate answering the question "Can we traverse the arc and the node adjacent to this arc?"
boolean	Graph.containsNode(Graph<N,A>.Node node)	Checks if the graph contains the specified node.
boolean	Algorithm.GraphTraversalEndPredicate.endTraversalAfter(Graph<A,B>.Arc addedArc, Graph<A,B>.Node addedNode, C addedNodeContext)	Predicate answering the question "Must we end the traversal after we added the specific arc, node and calculated the specific node context?"
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getFirstPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode)	Returns the first found, not necessarily the shortest one, path between the specified source and destination nodes in the given graph.
static <A, B, T> Pair<GraphPath<A,B>,T>	Algorithm.getMinPathWithContext(Graph<A,B> graph, Graph<A,B>.Node sourceNode, BiPredicate<Graph<A,B>.Node,T> searchSuccessPredicate, T sourceNodeContext, BiFunction<T,Graph<A,B>.Arc,T> contextProvider, Comparator<T> contextComparator)	Returns a minimal-context path in the graph using a context-aware variant of Dijkstra’s algorithm.
Graph<N,A>.Arc	GraphPath.getNextArc(Graph<N,A>.Node node)	Returns the arc that follows the specified node in this path.
Graph<N,A>.Arc	GraphPath.getPrevArc(Graph<N,A>.Node node)	Returns the arc that precedes the specified node in this path.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns shortest path between the two specified graph nodes.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, double range)	Returns shortest path between the two specified graph nodes if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns shortest path between the two specified graph nodes.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, double range)	Returns shortest path between the two specified graph nodes if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator, if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, Set<Graph<A,B>.Arc> barrierArcs, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, List<Predicate<Graph<A,B>.Node>> destNodeIndicators, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns shortest path from the specified graph node through nodes specified by indicators.
boolean	Graph.removeNode(Graph<N,A>.Node node)	Attempts to remove the specified node from the graph.
static <A, B> Map<Graph<A,B>.Node,Integer>	Algorithm.topologicalSort(Graph<A,B> graph, Graph<A,B>.Node rootNode)	Performs topological sorting of the graph with respect to the specified root node and returns a map containing mapping from graph nodes to integer numbers.
static <A, B, C> C	Algorithm.traverse(Graph<A,B>.Node sourceNode, C sourceContext, Algorithm.GraphTraversalPredicate<A,B> traversedArcPredicate, Algorithm.GraphTraversalContextCalculator<A,B,C> recalculateNodeContext, Algorithm.GraphTraversalEndPredicate<A,B,C> endTraversalPredicate)	Traverses the graph starting from the specified sourceNode by adding the arcs and nodes allowed by traversedArcPredicate until all reachable nodes are traversed or the specified endTraversalPredicate evaluated to true.

Method parameters in com.amalgamasimulation.graph with type arguments of type Graph.Node

Modifier and Type	Method	Description
static <A, B> GraphPath<A,B>	Algorithm.calculateShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Calculates shortest path between the two specified nodes having data about nodes of the minimal spanning tree and arcs of the minimal spanning tree, i.e.
static <A, B> Set<Graph<A,B>.Arc>	Algorithm.getBarrierArcs(Set<Graph<A,B>.Node> insignificantNodes, Set<Graph<A,B>.Arc> insignificantArcs)
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> List<Pair<Graph<A,B>.Node,Double>>	Algorithm.getClosestNodes(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, double range, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, int maxNodesCount)	Returns list of pairs of nodes and distances to them from the specified source node satisfying the condition determined by the specified indicator.
static <A, B> Pair<Set<Graph<A,B>.Node>,Set<Graph<A,B>.Arc>>	Algorithm.getInsignificantNodesAndArcs(Graph<A,B> graph, Set<Graph<A,B>.Node> significantNodes)	Returns the pair containing sets of insignificant nodes and arcs of the specified graph against the specified set of significant nodes.
static <A, B> Pair<Set<Graph<A,B>.Node>,Set<Graph<A,B>.Arc>>	Algorithm.getInsignificantNodesAndArcs(Graph<A,B> graph, Set<Graph<A,B>.Node> significantNodes, Set<Graph<A,B>.Arc> barrierArcs)	Returns the pair containing sets of insignificant nodes and arcs of the specified graph against the specified set of significant nodes.
static <A, B, T> Pair<GraphPath<A,B>,T>	Algorithm.getMinPathWithContext(Graph<A,B> graph, Graph<A,B>.Node sourceNode, BiPredicate<Graph<A,B>.Node,T> searchSuccessPredicate, T sourceNodeContext, BiFunction<T,Graph<A,B>.Arc,T> contextProvider, Comparator<T> contextComparator)	Returns a minimal-context path in the graph using a context-aware variant of Dijkstra’s algorithm.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns shortest path between the two specified graph nodes.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Graph<A,B>.Node destNode, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, double range)	Returns shortest path between the two specified graph nodes if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator, if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator, if the total weight of such path does not exceed the specified range.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, Set<Graph<A,B>.Arc> barrierArcs, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, Predicate<Graph<A,B>.Node> destNodeIndicator, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter, Map<Graph<A,B>.Node,Double> outNodeWeights, Set<Graph<A,B>.Arc> outArcsVisited, Set<Graph<A,B>.Arc> barrierArcs, double range)	Returns shortest path from the specified graph node to the closest graph node satisfying the condition determined by the specified indicator.
static <A, B> GraphPath<A,B>	Algorithm.getShortestPath(Graph<A,B> graph, Graph<A,B>.Node sourceNode, List<Predicate<Graph<A,B>.Node>> destNodeIndicators, Function<Graph<A,B>.Arc,Double> arcWeighter, Function<Graph<A,B>.Node,Double> nodeWeighter)	Returns shortest path from the specified graph node through nodes specified by indicators.
int	Graph.removeAllNodes(Collection<Graph<N,A>.Node> nodesToRemove)	Attempts to remove all specified nodes from the graph and returns number of nodes actually removed.
static <A, B> Map<Graph<A,B>.Node,Integer>	Algorithm.topologicalSort(Graph<A,B> graph, List<Graph<A,B>.Node> rootNodes)	Performs topological sorting of the graph with respect to the specified root nodes and returns a map containing mapping from graph nodes to integer numbers.

Constructors in com.amalgamasimulation.graph with parameters of type Graph.Node

Modifier	Constructor	Description
	GraphPath(Graph<N,A>.Node node)	Creates a graph path containing a single specified graph node.

Uses of Graph.Node in com.amalgamasimulation.graphagent

Fields in com.amalgamasimulation.graphagent with type parameters of type Graph.Node

Modifier and Type	Field	Description
protected Map<Graph<N,A>.Node,List<LongAgent<N,A>>>	LongAgent.adjacentAgents
protected Map<Pair<Graph<N,A>.Node,Graph<N,A>.Node>,Set<Graph<N,A>.Arc>>	GraphEnvironment.barrierArcsCache
protected Map<Pair<Graph<N,A>.Node,Graph<N,A>.Node>,Set<Graph<N,A>.Arc>>	GraphEnvironment.barrierArcsCache
protected Map<Pair<K,Graph<N,A>.Node>,com.amalgamasimulation.graphagent.CachedMinTree<N,A>>	GraphEnvironment.cachedMinTreesWithAgents
protected Map<Graph<N,A>.Node,com.amalgamasimulation.graphagent.CachedMinTree<N,A>>	GraphEnvironment.cachedMinTreesWithoutAgents
protected Map<Pair<K,Pair<Graph<N,A>.Node,Graph<N,A>.Node>>,CachedShortestPath<N,A>>	GraphEnvironment.cachedShortestPathsWithAgents
protected Map<Pair<K,Pair<Graph<N,A>.Node,Graph<N,A>.Node>>,CachedShortestPath<N,A>>	GraphEnvironment.cachedShortestPathsWithAgents
protected Map<Pair<Graph<N,A>.Node,Graph<N,A>.Node>,CachedShortestPath<N,A>>	GraphEnvironment.cachedShortestPathsWithoutAgents
protected Map<Pair<Graph<N,A>.Node,Graph<N,A>.Node>,CachedShortestPath<N,A>>	GraphEnvironment.cachedShortestPathsWithoutAgents
protected List<Graph<N,A>.Node>	LongAgent.occupiedNodes

Methods in com.amalgamasimulation.graphagent that return Graph.Node

Modifier and Type	Method	Description
Graph<N,A>.Node	GraphEnvironment.addNode(N nodeValue)	Creates a new graph node with the specified node value and adds it to the graph.
Graph<N,A>.Node	GraphAgent.getCurrentNode()	Returns the node where this agent is currently located, or null if this agent is not currently located at a node
Graph<N,A>.Node	GraphEnvironment.getGraphNode(N nodeValue)	Returns graph node (an instance of Graph.Node) containing the specified value.
Graph<N,A>.Node	GeometricGraphPosition.getNode()	Returns the node if this position points to graph node, null otherwise

Methods in com.amalgamasimulation.graphagent that return types with arguments of type Graph.Node

Modifier and Type	Method	Description
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent)	Returns the nodes for which the specified predicate returns true located within the specified range from the specified source node.
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator, double range)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, int maxNodesCount)
List<Graph<N,A>.Node>	GraphEnvironment.getNodes()	Returns an unmodifiable list of all graph nodes.
List<Graph<N,A>.Node>	LongAgent.getOccupiedNodes()	Returns the unmodifiable list of nodes currently occupied by this long agent.

Methods in com.amalgamasimulation.graphagent with parameters of type Graph.Node

Modifier and Type	Method	Description
protected void	LongAgent.addAdjacentAgent(Graph<N,A>.Node node, LongAgent<N,A> adjacentAgent)
GeometricGraphPath<N,A>	GeometricGraphPath.addNode(Graph<N,A>.Node node)
void	GraphAgent.afterEnteredNode(Graph<N,A>.Node node)	Callback method called immediately after entering a node.
void	LongAgent.afterEnteredNode(Graph<N,A>.Node node)
void	LongAgent.afterHeadEnteredNode(Graph<N,A>.Node node)	Callback method called immediately after the head of this long agent enters a node.
void	GraphAgent.beforeExitedNode(Graph<N,A>.Node node)	Callback method called before exiting a node.
void	LongAgent.beforeExitedNode(Graph<N,A>.Node node)
void	LongAgentTail.beforeExitedNode(Graph<N,A>.Node node)
void	LongAgent.beforeTailExitedNode(Graph<N,A>.Node node)	Callback method called before the tail of this long agent exits a node.
protected void	LongAgent.checkNodeForOccupancy(Graph<N,A>.Node node)
protected void	GraphAgent.enterNodeInternal(Graph<N,A>.Node node)
protected void	LongAgent.enterNodeInternal(Graph<N,A>.Node node)
List<LongAgent<N,A>>	LongAgent.getAdjacentAgents(Graph<N,A>.Node node)	Returns list of LongAgent which collided to this agent in the node and are waiting for it to free the node to continue moving.
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent)	Returns the nodes for which the specified predicate returns true located within the specified range from the specified source node.
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
AgentGraphPath<N,A>	GraphEnvironment.getShortestPath(Graph<N,A>.Node sourceNode, Graph<N,A>.Node destNode)
AgentGraphPath<N,A>	GraphEnvironment.getShortestPath(Graph<N,A>.Node sourceNode, Graph<N,A>.Node destNode, GraphAgent<N,A> agent)	Returns the shortest path from the specified source node to the specified destination node for the specified agent, or null if no such path exists.
protected GraphPath<N,A>	GraphEnvironment.getShortestPathBetweenNodesInternal(Graph<N,A> graph, Graph<N,A>.Node sourceNode, Graph<N,A>.Node destNode, Function<Graph<N,A>.Arc,Double> arcWeighter, Function<Graph<N,A>.Node,Double> nodeWeighter, Map<Graph<N,A>.Node,Double> nodeWeights, Set<Graph<N,A>.Arc> arcsVisited, GraphAgent<N,A> agent)
CompletionStage<Void>	GraphAgent.jumpTo(Graph<N,A>.Node node)	Jumps this agent to the specified node of graph of this agent's GraphEnvironment.
CompletionStage<Void>	LongAgent.jumpTo(Graph<N,A>.Node node)
protected void	GraphAgent.jumpToInternal(Graph<N,A>.Node node)
CompletionStage<Void>	GraphAgent.moveTo(Graph<N,A>.Node node, double velocity)	Starts moving this agent to the specified node in the graph with the specified velocity along the shortest path from agent's current position.
CompletionStage<Void>	LongAgent.moveTo(Graph<N,A>.Node node, double velocity)
static <N extends GeometricGraphNode, A extends GeometricGraphArc> GeometricGraphPath<N,A>	GeometricGraphPath.of(Graph<N,A>.Node node)	Creates a new zero-length path consisting only of a position at the specified node.
static <N extends GeometricGraphNode, A extends GeometricGraphArc> GeometricGraphPosition<N,A>	GeometricGraphPosition.of(Graph<N,A>.Node node)	Returns an instance of GeometricGraphPosition pointing to the specified graph node.
void	LongAgent.removeNodeAdjacentAgents(Graph<N,A>.Node node)	Clear adjacent agents collection in specified node and try to continue movement of adjacent agents.

Method parameters in com.amalgamasimulation.graphagent with type arguments of type Graph.Node

Modifier and Type	Method	Description
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent)	Returns the nodes for which the specified predicate returns true located within the specified range from the specified source node.
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, BiFunction<A,K,Double> arcWeighter, BiFunction<N,K,Double> nodeWeighter, int maxNodesCount)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, GraphAgent<N,A> agent, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(Graph<N,A>.Node sourceNode, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, Map<Graph<N,A>.Node,Double> outNodeWeights, Set<Graph<N,A>.Arc> outArcsVisited)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator, double range)
List<Pair<Graph<N,A>.Node,Double>>	GraphEnvironment.getClosestNodes(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator, double range, int maxNodesCount)
protected AgentGraphPath<N,A>	GraphAgent.getShortestPath(Predicate<Graph<N,A>.Node> indicator)
AgentGraphPath<N,A>	GraphEnvironment.getShortestPath(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator)
AgentGraphPath<N,A>	GraphEnvironment.getShortestPath(GeometricGraphPosition<N,A> sourcePosition, Predicate<Graph<N,A>.Node> destNodeIndicator, GraphAgent<N,A> agent)	Returns the shortest path from the specified source position to the closest node on which the specified predicate returns true, or null if no such path exists or the predicate returns false for all nodes reachable from the source position.
protected AgentGraphPath<N,A>	LongAgent.getShortestPath(Predicate<Graph<N,A>.Node> indicator)
protected GraphPath<N,A>	GraphEnvironment.getShortestPathBetweenNodesInternal(Graph<N,A> graph, Graph<N,A>.Node sourceNode, Graph<N,A>.Node destNode, Function<Graph<N,A>.Arc,Double> arcWeighter, Function<Graph<N,A>.Node,Double> nodeWeighter, Map<Graph<N,A>.Node,Double> nodeWeights, Set<Graph<N,A>.Arc> arcsVisited, GraphAgent<N,A> agent)
CompletionStage<Void>	GraphAgent.moveTo(Predicate<Graph<N,A>.Node> indicator, double velocity)	Starts movement of the agent from the current position (node or arc) to the specified graph node along the shortest path.
CompletionStage<Void>	LongAgent.moveTo(Predicate<Graph<N,A>.Node> indicator, double velocity)
protected void	GraphAgent.moveToIndicatorInternal(Predicate<Graph<N,A>.Node> indicator, double velocity)

Constructors in com.amalgamasimulation.graphagent with parameters of type Graph.Node

Modifier	Constructor	Description
	GeometricGraphPosition(Graph<N,A>.Node node)	Creates a new position pointing to the specified graph node.

Constructor parameters in com.amalgamasimulation.graphagent with type arguments of type Graph.Node

Modifier	Constructor	Description
	CachedShortestPath(GraphPath<N,A> path, double weigth, Map<Graph<N,A>.Node,Double> nodeWeights)

Uses of Graph.Node in com.amalgamasimulation.trains

Methods in com.amalgamasimulation.trains that return Graph.Node

Modifier and Type	Method	Description
Graph<RailNode,RailArc>.Node	TrainsEnvironment.addNode(RailNode railNode)

Methods in com.amalgamasimulation.trains with parameters of type Graph.Node

Modifier and Type	Method	Description
protected double	TrainsEnvironment.getEndMovementTime(List<Graph<RailNode,RailArc>.Arc> arcs, double agentLengthBeforeDestNode, double beginTime, double velocity, double agentLength, Graph<RailNode,RailArc>.Arc beforePathSourceArc, boolean isIncludeArcAfterNode, Graph<RailNode,RailArc>.Node destNode, LongAgentWeightKey weighterKey)
AgentGraphPath<RailNode,RailArc>	TrainsEnvironment.getShortestPath(Graph<RailNode,RailArc>.Node sourceNode, Graph<RailNode,RailArc>.Node destNode)
protected double	TrainsEnvironment.getStartMovementTime(com.amalgamasimulation.trains.TrainsEnvironment.ContextRecord context, double agentLengthBeforeDestNode, double beginTime, double velocity, double agentLength, Graph<RailNode,RailArc>.Arc beforePathSourceArc, boolean isIncludeArcAfterNode, Graph<RailNode,RailArc>.Node destNode, LongAgentWeightKey weighterKey)
CompletionStage<Void>	Train.moveTo(Graph<RailNode,RailArc>.Node node, double velocity)

Method parameters in com.amalgamasimulation.trains with type arguments of type Graph.Node

Modifier and Type	Method	Description
AgentGraphPath<RailNode,RailArc>	TrainsEnvironment.getShortestPath(GeometricGraphPosition<RailNode,RailArc> sourcePosition, Predicate<Graph<RailNode,RailArc>.Node> destNodeIndicator)
CompletionStage<Void>	Train.moveTo(Predicate<Graph<RailNode,RailArc>.Node> indicator, double velocity)