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

Packages that use Graph.Arc

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

Uses of Graph.Arc in com.amalgamasimulation.graph

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

Modifier and Type	Field	Description
protected ArrayList<Graph<N,A>.Arc>	Graph.Node.arcsIn
protected List<Graph<N,A>.Arc>	Graph.arcsList
protected ArrayList<Graph<N,A>.Arc>	Graph.Node.arcsOut
protected Map<A,Graph<N,A>.Arc>	Graph.valuesToArcs

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

Modifier and Type	Method	Description
Graph<N,A>.Arc	Graph.addArc(A arcValue, N sourceNodeValue, N destNodeValue)	Adds an arc containing the specified value to the graph.
Graph<N,A>.Arc	Graph.getArc(A value)	Returns a graph arc containing the specified value.
Graph<N,A>.Arc	GraphPath.getArc(A value)
Graph<N,A>.Arc	GraphPath.getFirstArc()	Returns the first arc of this path, or null if this path has no arcs.
Graph<N,A>.Arc	Graph.Node.getFirstArcIn()	Returns first arc coming to the node.
Graph<N,A>.Arc	Graph.Node.getFirstArcOut()	Returns first arc going out of the node.
Graph<N,A>.Arc	GraphPath.getLastArc()	Returns the last arc of this path, or null if this path has no arcs.
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.

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

Modifier and Type	Method	Description
List<Graph<N,A>.Arc>	Graph.getArcs()	Returns unmodifiable list of all arcs in the graph.
List<Graph<N,A>.Arc>	GraphPath.getArcs()	Returns an unmodifiable list of arcs of this path.
List<Graph<N,A>.Arc>	Graph.Node.getArcsIn()	Returns an unmodifiable list of arcs coming to the node.
List<Graph<N,A>.Arc>	Graph.Node.getArcsOut()	Returns an unmodifiable list of arcs going out of the node.
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> 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.

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

Modifier and Type	Method	Description
GraphPath<N,A>	GraphPath.appendArc(Graph<N,A>.Arc arc)	Appends the specified arc and its destination node to this path.
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?"
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.containsArc(Graph<N,A>.Arc arc)	Checks if the graph contains the specified arc.
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?"
GraphPath<N,A>	GraphPath.prependArc(Graph<N,A>.Arc arc)	Prepends the specified arc and its source node to this path.
boolean	Graph.removeArc(Graph<N,A>.Arc arc)	Attempts to remove the specified arc from the graph.

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

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> 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, 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)	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)	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, 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.removeAllArcs(Collection<Graph<N,A>.Arc> arcsToRemove)	Attempts to remove all specified arcs from the graph and returns number of arcs actually removed.

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

Modifier	Constructor	Description
	GraphPath(Graph<N,A>.Arc... arcs)	Creates a graph path consisting of the specified sequence of graph arcs and corresponding graph nodes.

Constructor parameters in com.amalgamasimulation.graph with type arguments of type Graph.Arc

Modifier	Constructor	Description
	GraphPath(List<Graph<N,A>.Arc> arcs)	Creates a graph path consisting of the specified sequence of graph arcs and corresponding graph nodes.

Uses of Graph.Arc in com.amalgamasimulation.graphagent

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

Modifier and Type	Field	Description
protected Map<Graph<N,A>.Arc,LongAgent<N,A>>	LongAgentsEnvironment.arcsToSeizingAgents
protected Map<Graph<N,A>.Arc,List<LongAgent<N,A>>>	LongAgentsEnvironment.arcsToWaitingAgents
protected Map<Pair<Graph<N,A>.Node,Graph<N,A>.Node>,Set<Graph<N,A>.Arc>>	GraphEnvironment.barrierArcsCache
protected List<Graph<N,A>.Arc>	LongAgent.occupiedArcs

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

Modifier and Type	Method	Description
Graph<N,A>.Arc	GraphEnvironment.addArc(N sourceNodeValue, N destNodeValue, A arcValue)	Creates a new graph arc between the nodes with the specified values.
Graph<N,A>.Arc	GeometricGraphArcRecord.arc()	Returns the value of the arc record component.
Graph<N,A>.Arc	GeometricGraphPosition.getArc()	Returns the arc if this position points place on a graph arc, null otherwise
Graph<N,A>.Arc	GraphAgent.getCurrentArc()	Returns the arc on which this agent is currently located, or null if this agent is not currently located on an arc
Graph<N,A>.Arc	GraphEnvironment.getGraphArc(A arcValue)	Returns graph arc (an instance of Graph.Arc) containing the specified value.
protected Graph<N,A>.Arc	LongAgent.getNextPathArc()

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

Modifier and Type	Method	Description
Pair<Graph<N,A>.Arc,Graph<N,A>.Arc>	GraphEnvironment.addArc(N sourceNodeValue, N destNodeValue, A arcValue, A reverseArcValue)	Creates two new graph arcs (one forward and one backward) between the nodes with the specified values.
Pair<Graph<N,A>.Arc,Graph<N,A>.Arc>	GraphEnvironment.addArc(N sourceNodeValue, N destNodeValue, A arcValue, A reverseArcValue)	Creates two new graph arcs (one forward and one backward) between the nodes with the specified values.
List<Graph<N,A>.Arc>	GraphEnvironment.getArcs()	Returns an unmodifiable list of all graph arcs.
List<Graph<N,A>.Arc>	LongAgent.getOccupiedArcs()	Returns the unmodifiable list of arcs currently occupied by this long agent.

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

Modifier and Type	Method	Description
void	GraphAgent.afterEnteredArc(Graph<N,A>.Arc arc)	Callback method called immediately after entering an arc.
void	LongAgent.afterEnteredArc(Graph<N,A>.Arc arc)
void	LongAgentTail.afterEnteredArc(Graph<N,A>.Arc arc)
void	LongAgent.afterHeadEnteredArc(Graph<N,A>.Arc arc)	Callback method called immediately after the head of this long agent enters an arc.
boolean	GraphAgent.allowEnterArc(Graph<N,A>.Arc arc)	Callback method used to implement advanced functionality like passby or waiting for something specific before entering arcs.
boolean	LongAgent.allowEnterArc(Graph<N,A>.Arc arc)
GeometricGraphPath<N,A>	GeometricGraphPath.appendArc(Graph<N,A>.Arc arc)	Appends the specified arc and its destination node to this path.
void	GraphAgent.beforeExitedArc(Graph<N,A>.Arc arc)	Callback method called before exiting entering an arc.
void	LongAgent.beforeExitedArc(Graph<N,A>.Arc arc)
void	LongAgentTail.beforeExitedArc(Graph<N,A>.Arc arc)
void	LongAgent.beforeTailExitedArc(Graph<N,A>.Arc arc)	Callback method called before the tail of this long agent exits an arc.
protected void	LongAgent.checkArcsBeforeJumping(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs)
protected void	GraphAgent.enterArcInternal(Graph<N,A>.Arc arc, double arcAbsOffset, Segment segment, double segmentAbsOffset)
double	GeometricGraphPath.getLengthAlongArc(Graph<N,A>.Arc arc)
CompletionStage<Void>	GraphAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset)	Jumps this agent to the specified absolute offset of the specified arc of graph of this agent's GraphEnvironment.
CompletionStage<Void>	LongAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset)
void	LongAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs)	Jumps this agent to the specified arc at the specified absolute offset and places it on the specified list of previous arcs.
protected void	LongAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs, boolean isFirsNodeIncluded, boolean isLastNodeIncluded)
protected void	GraphAgent.jumpToInternal(Graph<N,A>.Arc arc, double arcAbsOffset)
protected void	LongAgent.jumpToSeveralArcs(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs, boolean isFirsNodeIncluded, boolean isLastNodeIncluded)
static <N extends GeometricGraphNode, A extends GeometricGraphArc> GeometricGraphPath<N,A>	GeometricGraphPath.of(Graph<N,A>.Arc... arcs)	Creates a new instance of GeometricGraphPath consisting of zero, one, or several consecutive arcs.
static <N extends GeometricGraphNode, A extends GeometricGraphArc> GeometricGraphPosition<N,A>	GeometricGraphPosition.of(Graph<N,A>.Arc arc, double arcAbsOffset)	Returns an instance of GeometricGraphPosition pointing to the point on the specified arc located at the specified absolute offset from arc's beginning.
void	LongAgentsEnvironment.onReleasedArcEntrance(LongAgent<N,A> agent, Graph<N,A>.Arc arc)
void	LongAgentsEnvironment.onSeizedArcEntrance(LongAgent<N,A> agent, Graph<N,A>.Arc arc)
GeometricGraphPath<N,A>	GeometricGraphPath.prependArc(Graph<N,A>.Arc arc)	Prepends the specified arc and its source node to this path.
boolean	LongAgentsEnvironment.tryEnterArc(LongAgent<N,A> agent, Graph<N,A>.Arc arc)

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

Modifier and Type	Method	Description
protected void	LongAgent.checkArcsBeforeJumping(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs)
protected void	LongAgent.checkArcsOrder(List<Graph<N,A>.Arc> arcs)
protected void	LongAgent.checkReverseArcs(List<Graph<N,A>.Arc> arcs)
protected void	LongAgent.checkSelfOverlay(List<Graph<N,A>.Arc> arcs, double firstArcOffset, double lastArcOffset)
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)
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)
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)
void	LongAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs)	Jumps this agent to the specified arc at the specified absolute offset and places it on the specified list of previous arcs.
protected void	LongAgent.jumpTo(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs, boolean isFirsNodeIncluded, boolean isLastNodeIncluded)
void	LongAgent.jumpTo(GeometricGraphPosition<N,A> position, List<Graph<N,A>.Arc> previousArcs)	Jumps this agent to the specified position and places it on the specified list of previous arcs.
protected void	LongAgent.jumpToSeveralArcs(Graph<N,A>.Arc arc, double arcAbsOffset, List<Graph<N,A>.Arc> previousArcs, boolean isFirsNodeIncluded, boolean isLastNodeIncluded)
static <N extends GeometricGraphNode, A extends GeometricGraphArc> GeometricGraphPath<N,A>	GeometricGraphPath.of(List<Graph<N,A>.Arc> arcs)	Creates a new instance of GeometricGraphPath consisting of zero, one, or several consecutive arcs.

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

Modifier	Constructor	Description
	GeometricGraphArcRecord(int arcIndex, Graph<N,A>.Arc arc, Interval arcAbsOffsets, Interval pathAbsOffsets, GeometricGraphPosition<N,A> beginPosition, GeometricGraphPosition<N,A> endPosition)	Creates an instance of a GeometricGraphArcRecord record class.
	GeometricGraphPath(Graph<N,A>.Arc arc, double arcBeginAbsOffset, double arcEndAbsOffset)	Creates a new instance of graph path consisting of a fraction of the single specified arc located between the specified offsets.
	GeometricGraphPosition(Graph<N,A>.Arc arc, double arcAbsOffset)	Creates a new position pointing to the point on the specified arc located at the specified absolute offset from arc's beginning.

Uses of Graph.Arc in com.amalgamasimulation.trains

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

Modifier and Type	Method	Description
Graph<RailNode,RailArc>.Arc	TrainsEnvironment.addArc(RailNode n1, RailNode n2, RailArc a)
Graph<RailNode,RailArc>.Arc	RailTrack.getBackwardArc()	Returns the graph arc corresponding to backward direction of this track.
Graph<RailNode,RailArc>.Arc	RailTrack.getForwardArc()	Returns the graph arc corresponding to forward direction of this track.

Methods in com.amalgamasimulation.trains that return types with arguments of type Graph.Arc

Modifier and Type	Method	Description
Pair<Graph<RailNode,RailArc>.Arc,Graph<RailNode,RailArc>.Arc>	TrainsEnvironment.addArc(RailNode n1, RailNode n2, RailArc a1, RailArc a2)
Pair<Graph<RailNode,RailArc>.Arc,Graph<RailNode,RailArc>.Arc>	TrainsEnvironment.addArc(RailNode n1, RailNode n2, RailArc a1, RailArc a2)

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

Modifier and Type	Method	Description
void	Train.afterHeadEnteredArc(Graph<RailNode,RailArc>.Arc arc)
void	Train.beforeExitedArc(Graph<RailNode,RailArc>.Arc arc)
void	Train.beforeTailExitedArc(Graph<RailNode,RailArc>.Arc arc)
protected void	Train.checkArcsBeforeJumping(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, List<Graph<RailNode,RailArc>.Arc> previousArcs)
RailTrack	TrainsEnvironment.createNewRailTrack(String name, Graph<RailNode,RailArc>.Arc forwardArc, Graph<RailNode,RailArc>.Arc backwardArc)	Creates a new RailTrack with the specified name and connecting arcs.
static double	TrainsEnvironment.getAngleBetweenArcs(Graph<RailNode,RailArc>.Arc prevArc, Graph<RailNode,RailArc>.Arc nextArc)	Calculates the angle (in radians) between two consecutive arcs.
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)
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)
boolean	TrainsEnvironment.isAngleSharp(Graph<RailNode,RailArc>.Arc prevArc, Graph<RailNode,RailArc>.Arc nextArc)	Determines whether the corner formed by two consecutive arcs is a sharp angle.
CompletionStage<Void>	Train.jumpTo(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, boolean shouldBookArcs)	Jumps this agent to the specified absolute offset of the specified arc of graph of this agent's GraphEnvironment.
void	Train.jumpTo(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, List<Graph<RailNode,RailArc>.Arc> previousArcs, boolean shouldBookArcs)	Jumps this agent to the specified arc at the specified absolute offset and places it on the specified list of previous arcs.
static RailDestination	RailDestination.of(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset)	Creates a new instance of the rail destination by the specified arc and offset.
static RailDestination	RailDestination.of(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, TrainsEnvironment.TrainDirection movementEndTrainDirection)	Creates a new instance of the rail destination by the specified GeometricGraphPosition and information about which side of the train should arrive at the destination.

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

Modifier and Type	Method	Description
protected void	Train.checkArcsBeforeJumping(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, List<Graph<RailNode,RailArc>.Arc> previousArcs)
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)
void	Train.jumpTo(Graph<RailNode,RailArc>.Arc arc, double arcAbsOffset, List<Graph<RailNode,RailArc>.Arc> previousArcs, boolean shouldBookArcs)	Jumps this agent to the specified arc at the specified absolute offset and places it on the specified list of previous arcs.

Constructors in com.amalgamasimulation.trains with parameters of type Graph.Arc

Modifier	Constructor	Description
protected	RailTrack(String name, Graph<RailNode,RailArc>.Arc forwardArc, Graph<RailNode,RailArc>.Arc backwardArc)	Creates a new instance of a rail track using the forward and backward arcs specified.