Uses of Class
com.amalgamasimulation.graph.GraphPath

Packages that use GraphPath

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

Uses of GraphPath in com.amalgamasimulation.graph

Methods in com.amalgamasimulation.graph that return GraphPath

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.
GraphPath<N,A>	GraphPath.append(GraphPath<N,A> otherPath)	Appends the specified other path to this path.
GraphPath<N,A>	GraphPath.appendArc(Graph<N,A>.Arc arc)	Appends the specified arc and its destination node to this path.
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 <N, A> GraphPath<N,A>	GraphPath.emptyPath()	Returns an instance of an empty path, i.e.
GraphPath<N,A>	GraphPath.getCopy()	Returns a copy of this path.
static <A, B> GraphPath<A,B>	Algorithm.getFirstCycle(Graph<A,B> graph)	Returns first found cycle in the specified graph.
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> 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.
GraphPath<N,A>	GraphPath.getSubPath(int fromNodeIndexInclusive, int toNodeIndexInclusive)	Returns a sub-path of this path located between the nodes with the specified indices.
GraphPath<N,A>	GraphPath.getSubPathFrom(int fromNodeIndexInclusive)	Returns a sub-path of this path located between the node with the specified index and the last node of this path.
GraphPath<N,A>	GraphPath.getSubPathTo(int toNodeIndexInclusive)	Returns a sub-path of this path located between its first node and the node with the specified index.
GraphPath<N,A>	GraphPath.prepend(GraphPath<N,A> otherPath)	Prepends the specified other path to this path.
GraphPath<N,A>	GraphPath.prependArc(Graph<N,A>.Arc arc)	Prepends the specified arc and its source node to this path.

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

Modifier and Type	Method	Description
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.

Methods in com.amalgamasimulation.graph with parameters of type GraphPath

Modifier and Type	Method	Description
GraphPath<N,A>	GraphPath.append(GraphPath<N,A> otherPath)	Appends the specified other path to this path.
GraphPath<N,A>	GraphPath.prepend(GraphPath<N,A> otherPath)	Prepends the specified other path to this path.

Constructors in com.amalgamasimulation.graph with parameters of type GraphPath

Modifier	Constructor	Description
	GraphPath(GraphPath<N,A> path)	Creates a graph path that is a copy of other specified graph path.

Uses of GraphPath in com.amalgamasimulation.graphagent

Subclasses of GraphPath in com.amalgamasimulation.graphagent

Modifier and Type	Class	Description
class	AgentGraphPath<N extends AgentGraphNode,A extends AgentGraphArc>	Path of a GraphAgent from some GeometricGraphPosition to some other, probably equal or adjacent GeometricGraphPosition.
class	CachedShortestPath<N extends AgentGraphNode,A extends AgentGraphArc>	This class is not a part of public API of this library.
class	GeometricGraphPath<N extends GeometricGraphNode,A extends GeometricGraphArc>	Path from some GeometricGraphPosition to some other, probably equal or adjacent, GeometricGraphPosition.

Methods in com.amalgamasimulation.graphagent that return GraphPath

Modifier and Type	Method	Description
GraphPath<N,A>	CachedShortestPath.getCopy()
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)

Methods in com.amalgamasimulation.graphagent with parameters of type GraphPath

Modifier and Type	Method	Description
GeometricGraphPath<N,A>	GeometricGraphPath.append(GraphPath<N,A> otherPath)	Appends the specified other path to this path.
protected double	GraphEnvironment.calculatePathWeight(GraphPath<N,A> path, GraphAgent<N,A> agent)
protected AgentGraphPath<N,A>	LongAgent.createPathForTailAgent(GraphPath<N,A> path, GeometricGraphPosition<N,A> destPosition, GeometricGraphPosition<N,A> actualDestPosition)
GeometricGraphPath<N,A>	GeometricGraphPath.prepend(GraphPath<N,A> otherPath)	Prepends the specified other path to this path.

Constructors in com.amalgamasimulation.graphagent with parameters of type GraphPath

Modifier	Constructor	Description
	CachedShortestPath(GraphPath<N,A> path, double weigth)
	CachedShortestPath(GraphPath<N,A> path, double weigth, Map<Graph<N,A>.Node,Double> nodeWeights)
	GeometricGraphPath(GraphPath<N,A> path, GeometricGraphPosition<N,A> sourcePosition, GeometricGraphPosition<N,A> destPosition)	Creates a new instance of graph path by the specified GraphPath