Index (squidpath 4.0.9 API)

A B C D E F G H I L M N O P R S T U V W Z
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

A

a - Variable in class com.github.yellowstonegames.path.Connection
addConnection(Node, Node) - Method in class com.github.yellowstonegames.path.Graph
addConnection(Node, Node, float) - Method in class com.github.yellowstonegames.path.Graph
addConnection(Node, Node, float) - Method in class com.github.yellowstonegames.path.UndirectedGraph
addEdge(Node, float) - Method in class com.github.yellowstonegames.path.Node
addEdge(V, V) - Method in class com.github.yellowstonegames.path.Graph: Add an edge to the graph, from v to w.
addEdge(V, V, float) - Method in class com.github.yellowstonegames.path.Graph: Add an edge to the graph, from v to w and with the specified weight.
addVertex(V) - Method in class com.github.yellowstonegames.path.Graph: Adds a vertex to the graph.
addVertices(Collection) - Method in class com.github.yellowstonegames.path.Graph: Adds all the vertices in the collection to the graph.
addVertices(V...) - Method in class com.github.yellowstonegames.path.Graph: Adds all the vertices in the array or varargs to the graph.
AimLimit - Enum Class in com.github.yellowstonegames.path.technique: Enum used for common targeting limitations (or lack thereof, in the case of AimLimit.FREE ).
algorithms - Variable in class com.github.yellowstonegames.path.DirectedGraph
algorithms - Variable in class com.github.yellowstonegames.path.UndirectedGraph
algorithms() - Method in class com.github.yellowstonegames.path.DirectedGraph
algorithms() - Method in class com.github.yellowstonegames.path.Graph
algorithms() - Method in class com.github.yellowstonegames.path.UndirectedGraph
Algorithms<V> - Class in com.github.yellowstonegames.path: Most of the algorithms that operate on a Graph are defined here, with some specific cases in subclasses.
ALL - Static variable in enum class com.github.yellowstonegames.path.technique.AimLimit: The cached result of AimLimit.values(), so you can avoid repeatedly allocating AimLimit[] objects.
aoe - Variable in class com.github.yellowstonegames.path.technique.Technique
AOE - Interface in com.github.yellowstonegames.path.technique: Area of Effect interface meant to be implemented by various specific burst, line, flowing, and user-made AOE types.
apply(Coord, Coord) - Method in class com.github.yellowstonegames.path.technique.Technique: This does one last validation of the location aimAt (checking that it is within the valid range for this Technique) before getting the area affected by the AOE targeting that cell.
AreaUtils - Class in com.github.yellowstonegames.path.technique: Static utilities for use in AOE and anything else that might need CoordFloatOrderedMaps.
AreaUtils() - Constructor for class com.github.yellowstonegames.path.technique.AreaUtils
arrayToMap(boolean[][]) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: This takes a 2D boolean array and returns a CoordFloatOrderedMap, but will only use the value 1.0, and only for positions in map that have as their boolean element true.
arrayToMap(float[][]) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: This takes a 2D float array called map and returns a CoordFloatOrderedMap, and will have a key for every position in map that is greater than 0.0, with values equal to those in map.
arrayToMap(float[][], float) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: This takes a 2D float array and returns a CoordFloatOrderedMap, but will only use the value 1.0, and only does this if the passed float[][] has a value at that position that is greater than cutoff.
AStarSearch - Class in com.github.yellowstonegames.path: Performs A* search to find the shortest path between two Coord points.
AStarSearch() - Constructor for class com.github.yellowstonegames.path.AStarSearch
AStarSearch(char[][], Heuristic) - Constructor for class com.github.yellowstonegames.path.AStarSearch: Builds a pathing object to run searches on.
AStarSearch(float[][], Heuristic) - Constructor for class com.github.yellowstonegames.path.AStarSearch: Builds a pathing object to run searches on.

B

b - Variable in class com.github.yellowstonegames.path.Connection
breadthFirstSearch(Coord) - Method in class com.github.yellowstonegames.path.CostlyGraph: Perform a breadth first search starting from the specified vertex.
breadthFirstSearch(Coord) - Method in class com.github.yellowstonegames.path.DefaultGraph: Perform a breadth first search starting from the specified vertex.
breadthFirstSearch(Coord, int, int) - Method in class com.github.yellowstonegames.path.CostlyGraph: Perform a breadth first search starting from the specified vertex.
breadthFirstSearch(Coord, int, int) - Method in class com.github.yellowstonegames.path.DefaultGraph: Perform a breadth first search starting from the specified vertex.
breadthFirstSearch(V) - Method in class com.github.yellowstonegames.path.Algorithms: Perform a breadth first search starting from the specified vertex.
breadthFirstSearch(V, int, int) - Method in class com.github.yellowstonegames.path.Algorithms: Perform a breadth first search starting from the specified vertex.
BurstAOE - Class in com.github.yellowstonegames.path.technique: An AOE type that has a center and a radius, and uses shadowcasting to create a burst of rays from the center, out to the distance specified by radius.
BurstAOE(Coord, int, Radius) - Constructor for class com.github.yellowstonegames.path.technique.BurstAOE
BurstAOE(Coord, int, Radius, int, int) - Constructor for class com.github.yellowstonegames.path.technique.BurstAOE

C

calculate() - Method in class com.github.yellowstonegames.path.ZoneOfInfluence: Finds the zones of influence for each of the influences (inner arrays of Coord) this was constructed with, and returns all zones as a Region array.
canTarget(Coord, Coord) - Method in class com.github.yellowstonegames.path.technique.Technique: A quick yes-or-no check for whether a user at a given Coord can use this Technique to target the given Coord of a possibleTarget.
CHEBYSHEV - Static variable in interface com.github.yellowstonegames.path.Heuristic: A predefined Heuristic for Coord nodes in a 2D plane where diagonal movement is estimated as costing the same as orthogonal movement.
clearGoals() - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to remove all goals and undo any changes to gradientMap made by having a goal present.
collectionToMap(Collection) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: This takes a Collection of Coord, such as a Region, and returns a CoordFloatOrderedMap, but will only use the value 1.0, and only for positions in coll.
com.github.yellowstonegames.path - package com.github.yellowstonegames.path
com.github.yellowstonegames.path.technique - package com.github.yellowstonegames.path.technique
completed - Variable in class com.github.yellowstonegames.path.ZoneOfInfluence
ConeAOE - Class in com.github.yellowstonegames.path.technique: An AOE type that has an origin, a radius, an angle, and a span; it will blast from the origin to a length equal to radius along the angle (in degrees), moving somewhat around corners/obstacles, and also spread a total of span degrees around the angle (a span of 90 will affect a full quadrant, centered on angle).
ConeAOE(Coord, int, float, float, Radius) - Constructor for class com.github.yellowstonegames.path.technique.ConeAOE
ConeAOE(Coord, Coord, float, Radius) - Constructor for class com.github.yellowstonegames.path.technique.ConeAOE
Connection<V> - Class in com.github.yellowstonegames.path: The most-commonly-used class that represents an edge between nodes on a Graph.
Connection() - Constructor for class com.github.yellowstonegames.path.Connection
Connection(Node, Node) - Constructor for class com.github.yellowstonegames.path.Connection
Connection(Node, Node, float) - Constructor for class com.github.yellowstonegames.path.Connection
Connection.DirectedConnection<V> - Class in com.github.yellowstonegames.path: A Connection that treats A-to-B as a different edge from B-to-A.
Connection.UndirectedConnection<V> - Class in com.github.yellowstonegames.path: A Connection that treats A-to-B and B-to-A as the same edge.
connectionExists(Node, Node) - Method in class com.github.yellowstonegames.path.Graph
contains(V) - Method in class com.github.yellowstonegames.path.Graph: Check if the graph contains a vertex.
containsCycle() - Method in class com.github.yellowstonegames.path.Algorithms: Checks whether there are any cycles in the graph using depth first searches.
containsCycle() - Method in class com.github.yellowstonegames.path.CostlyGraph: Checks whether there are any cycles in the graph using depth first searches.
containsCycle() - Method in class com.github.yellowstonegames.path.DefaultGraph: Checks whether there are any cycles in the graph using depth first searches.
CostlyGraph - Class in com.github.yellowstonegames.path: A default setting for a DirectedGraph of Coord vertices where each passable cell has a cost to enter it from any passable neighbor.
CostlyGraph() - Constructor for class com.github.yellowstonegames.path.CostlyGraph: No-op no-arg constructor, present for serialization; if you use this you must call CostlyGraph.init(float[][]) or CostlyGraph.init(float[][], boolean) before using the CostlyGraph.
CostlyGraph(char[][]) - Constructor for class com.github.yellowstonegames.path.CostlyGraph: Builds a DefaultGraph from a 2D char array that treats '#', '+', and all box drawing characters as impassable, but considers all other cells passable for a cost of 1.0.
CostlyGraph(char[][], boolean) - Constructor for class com.github.yellowstonegames.path.CostlyGraph: Builds a DefaultGraph from a 2D char array that treats '#', '+', and all box drawing characters as impassable, but considers all other cells passable for a cost of 1.0.
CostlyGraph(float[][]) - Constructor for class com.github.yellowstonegames.path.CostlyGraph: Builds a DefaultGraph from a 2D float array that uses negative numbers to represent any kind of inaccessible cell, with all other numbers treated as possible to enter for a cost equal to that float.
CostlyGraph(float[][], boolean) - Constructor for class com.github.yellowstonegames.path.CostlyGraph: Builds a DefaultGraph from a 2D float array that uses negative numbers to represent any kind of inaccessible cell, with all other numbers treated as possible to enter for a cost equal to that float.
costMap - Variable in class com.github.yellowstonegames.path.DijkstraMap: This stores the entry cost multipliers for each cell; that is, a value of 1f is a normal, unmodified cell, but a value of 0.5f can be entered easily (two cells of its cost can be entered for the cost of one 1f cell), and a value of 2f can only be entered with difficulty (one cell of its cost can be entered for the cost of two 1f cells).
createNew() - Method in class com.github.yellowstonegames.path.DirectedGraph
createNew() - Method in class com.github.yellowstonegames.path.Graph
createNew() - Method in class com.github.yellowstonegames.path.UndirectedGraph
cutShort - Variable in class com.github.yellowstonegames.path.DijkstraMap

D

DARK - Static variable in class com.github.yellowstonegames.path.DijkstraMap: This is used to mark cells that the scan couldn't reach, and these dark cells are marked with a high number equal to 999800f .
decode(int) - Method in class com.github.yellowstonegames.path.DijkstraMap: If you for some reason have one of the internally-used ints produced by DijkstraMap.encode(Coord), this will convert it back to a Coord if you need it as such.
decodeX(int) - Method in class com.github.yellowstonegames.path.DijkstraMap: If you for some reason have one of the internally-used ints produced by DijkstraMap.encode(Coord), this will decode the x component of the point encoded in that int.
decodeY(int) - Method in class com.github.yellowstonegames.path.DijkstraMap: If you for some reason have one of the internally-used ints produced by DijkstraMap.encode(Coord), this will decode the y component of the point encoded in that int.
DEFAULT_WEIGHT - Static variable in class com.github.yellowstonegames.path.Connection
DefaultGraph - Class in com.github.yellowstonegames.path: A default setting for an UndirectedGraph of Coord vertices where all connections have cost 1.
DefaultGraph() - Constructor for class com.github.yellowstonegames.path.DefaultGraph: No-op no-arg constructor, present for serialization; if you use this you must call DefaultGraph.init(char[][]) or DefaultGraph.init(char[][], boolean) before using the DefaultGraph.
DefaultGraph(char[][]) - Constructor for class com.github.yellowstonegames.path.DefaultGraph: Builds a DefaultGraph from a 2D char array that uses '#' to represent any kind of inaccessible cell, with all other chars treated as walkable.
DefaultGraph(char[][], boolean) - Constructor for class com.github.yellowstonegames.path.DefaultGraph: Builds a DefaultGraph from a 2D char array that uses '#' to represent any kind of inaccessible cell, with all other chars treated as walkable.
depthFirstSearch(Coord) - Method in class com.github.yellowstonegames.path.CostlyGraph: Perform a depth first search starting from the specified vertex.
depthFirstSearch(Coord) - Method in class com.github.yellowstonegames.path.DefaultGraph: Perform a depth first search starting from the specified vertex.
depthFirstSearch(Coord, int, int) - Method in class com.github.yellowstonegames.path.CostlyGraph: Perform a depth first search starting from the specified vertex.
depthFirstSearch(Coord, int, int) - Method in class com.github.yellowstonegames.path.DefaultGraph: Perform a depth first search starting from the specified vertex.
depthFirstSearch(V) - Method in class com.github.yellowstonegames.path.Algorithms: Perform a depth first search starting from the specified vertex.
depthFirstSearch(V, int, int) - Method in class com.github.yellowstonegames.path.Algorithms: Perform a depth first search starting from the specified vertex.
DIAGONAL - Enum constant in enum class com.github.yellowstonegames.path.technique.AimLimit
dijkstra - Variable in class com.github.yellowstonegames.path.ZoneOfInfluence
DIJKSTRA - Static variable in interface com.github.yellowstonegames.path.Heuristic: A predefined Heuristic for Coord nodes in a 2D plane where the heuristic is not used, and all cells are considered equivalent regardless of actual distance.
DijkstraMap - Class in com.github.yellowstonegames.path: A group of pathfinding algorithms that explore in all directions equally, and are commonly used when there is more than one valid goal, or when you want a gradient floodfill to mark each cell in an area with its distance from a goal.
DijkstraMap() - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Construct a DijkstraMap without a level to actually scan.
DijkstraMap(char[][]) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Constructor meant to take a char[][] returned by DungeonBoneGen.generate(), or any other char[][] where '#' means a wall and anything else is a walkable tile.
DijkstraMap(char[][], char) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Constructor meant to take a char[][] returned by DungeonBoneGen.generate(), or any other char[][] where one char means a wall and anything else is a walkable tile.
DijkstraMap(char[][], Measurement) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Constructor meant to take a char[][] returned by DungeonBoneGen.generate(), or any other char[][] where '#' means a wall and anything else is a walkable tile.
DijkstraMap(float[][]) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Used to construct a DijkstraMap from the output of another.
DijkstraMap(float[][], Measurement) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Used to construct a DijkstraMap from the output of another, specifying a distance calculation.
DijkstraMap(float[][], Measurement, boolean) - Constructor for class com.github.yellowstonegames.path.DijkstraMap: Used to construct a DijkstraMap from either the output of another DijkstraMap, or from a resistance map of the type used by FOV.
dijkstraToHashMap(float[][]) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: This takes a DijkstraMap that has already completed a scan() and returns a CoordFloatOrderedMap, and will have a key for every position that was reached in the DijkstraMap, with 1.0 as the only value.
DirectedConnection() - Constructor for class com.github.yellowstonegames.path.Connection.DirectedConnection
DirectedGraph<V> - Class in com.github.yellowstonegames.path: A kind of Graph where all connections between vertices are one-way (but a connection may exist that goes from A to B and another connection may go from B to A), and each connection can have a different cost.
DirectedGraph() - Constructor for class com.github.yellowstonegames.path.DirectedGraph
DirectedGraph(Collection) - Constructor for class com.github.yellowstonegames.path.DirectedGraph
DirectedGraphAlgorithms<V> - Class in com.github.yellowstonegames.path: Algorithms specific to directed graphs, like CostlyGraph, as well as general Algorithms.
disconnect() - Method in class com.github.yellowstonegames.path.Node
disconnect(Node) - Method in class com.github.yellowstonegames.path.Graph
disconnect(V) - Method in class com.github.yellowstonegames.path.Graph
distance - Variable in class com.github.yellowstonegames.path.Node: Internal; confirmed distance so far to get to this Node from the start.

E

Edge<V> - Class in com.github.yellowstonegames.path: Abstract superclass of any connection between nodes on a graph.
Edge() - Constructor for class com.github.yellowstonegames.path.Edge
edgeExists(V, V) - Method in class com.github.yellowstonegames.path.Graph: Check if the graph contains an edge from v to w.
edgeSet - Variable in class com.github.yellowstonegames.path.Graph
EIGHT_WAY - Enum constant in enum class com.github.yellowstonegames.path.technique.AimLimit
encode(int, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Internally, DijkstraMap uses int primitives instead of Coord objects.
encode(Coord) - Method in class com.github.yellowstonegames.path.DijkstraMap: Internally, DijkstraMap uses int primitives instead of Coord objects.
equals(Object) - Method in class com.github.yellowstonegames.path.Connection.DirectedConnection
equals(Object) - Method in class com.github.yellowstonegames.path.Connection.UndirectedConnection
equals(Object) - Method in class com.github.yellowstonegames.path.CostlyGraph
equals(Object) - Method in class com.github.yellowstonegames.path.DefaultGraph
equals(Object) - Method in class com.github.yellowstonegames.path.Graph
equals(Object) - Method in class com.github.yellowstonegames.path.Node
equals(Object) - Method in class com.github.yellowstonegames.path.technique.Reach
equals(Object) - Method in class com.github.yellowstonegames.path.technique.Threat
estimate - Variable in class com.github.yellowstonegames.path.Node: Internal; estimated distance to get from this Node to the goal.
estimate(V, V) - Method in interface com.github.yellowstonegames.path.Heuristic: Calculates an estimated cost to reach the goal node from the given node.
EUCLIDEAN - Static variable in interface com.github.yellowstonegames.path.Heuristic: A predefined Heuristic for Coord nodes in a 2D plane where all movement is calculated "as-the-crow-flies," using the standard Pythagorean formula for distance as in the real world.

F

findArea() - Method in interface com.github.yellowstonegames.path.technique.AOE: This is how an AOE interacts with anything that uses it.
findArea() - Method in class com.github.yellowstonegames.path.technique.BurstAOE
findArea() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
findArea() - Method in class com.github.yellowstonegames.path.technique.LineAOE
findArea() - Method in class com.github.yellowstonegames.path.technique.PointAOE
findAttackPath(int, int, int, LineDrawer, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, until a cell is reached with a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange, which may go further from a goal if the minPreferredRange has not been met at the current distance.
findAttackPath(int, int, LineDrawer, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, until preferredRange is reached, or further from a goal if the preferredRange has not been met at the current distance.
findAttackPath(ObjectDeque, int, int, int, LineDrawer, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, until a cell is reached with a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange, which may go further from a goal if the minPreferredRange has not been met at the current distance.
findAttackPathLarge(int, int, int, int, LineDrawer, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, until a cell is reached with a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange, which may go further from a goal if the minPreferredRange has not been met at the current distance.
findAttackPathLarge(int, int, int, LineDrawer, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: For pathfinding creatures larger than 1x1 cell; scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, until preferredRange is reached, or further from a goal if the preferredRange has not been met at the current distance.
findFleePath(int, float, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan() with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
findFleePath(int, int, float, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan or DijkstraMap.partialScan with the listed fearSources and start point, and returns a list of Coord positions (using this DijkstraMap's metric) needed to get further from the closest fearSources, meant for running away.
findFleePath(ObjectDeque, int, int, float, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan or DijkstraMap.partialScan with the listed fearSources and start point, and returns a list of Coord positions (using this DijkstraMap's metric) needed to get further from the closest fearSources, meant for running away.
findFleePathLarge(int, int, float, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed fearSources and start point, and returns a list of Coord positions (using Manhattan distance) needed to get further from the closest fearSources, meant for running away.
findMinimumDistance(Coord, Coord) - Method in class com.github.yellowstonegames.path.CostlyGraph: Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findMinimumDistance(Coord, Coord) - Method in class com.github.yellowstonegames.path.DefaultGraph: Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findMinimumDistance(V, V) - Method in class com.github.yellowstonegames.path.Algorithms: Find the length of the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findMinimumDistance(V, V, Heuristic) - Method in class com.github.yellowstonegames.path.Algorithms: Find the length of the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findMinimumWeightSpanningTree() - Method in class com.github.yellowstonegames.path.DefaultGraph: Find a minimum weight spanning tree using Kruskal's algorithm.
findMinimumWeightSpanningTree() - Method in class com.github.yellowstonegames.path.UndirectedGraphAlgorithms: Find a minimum weight spanning tree using Kruskal's algorithm.
findNearest(Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map until it reaches a Coord in targets, then returns the first target found.
findNearest(Coord, Collection) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map until it reaches a Coord in targets, then returns the first target found.
findNearestMultiple(Coord, int, Collection) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map until it reaches a Coord in targets, then returns the first several targets found, up to limit or less if the map is fully searched without finding enough.
findPath(int, int, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan or DijkstraMap.partialScan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
findPath(int, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
findPath(ObjectDeque, int, int, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan or DijkstraMap.partialScan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
findPathLarge(int, int, int, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap
findPathLarge(int, int, Collection, Collection, Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: For pathfinding creatures larger than 1x1 cell; scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to the closest reachable goal.
findPathPreScanned(ObjectDeque, Coord) - Method in class com.github.yellowstonegames.path.DijkstraMap: When you can control how often the (relatively time-intensive) scan() method is called, but may need simple paths very frequently (such as for a path that follows the mouse), you can use this method to reduce the amount of work needed to find paths.
findPathPreScanned(Coord) - Method in class com.github.yellowstonegames.path.DijkstraMap: When you can control how often the (relatively time-intensive) scan() method is called, but may need simple paths very frequently (such as for a path that follows the mouse), you can use this method to reduce the amount of work needed to find paths.
findShortcutPath(Coord, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: If you have a target or group of targets you want to pathfind to without scanning the full map, this can be good.
findShortestPath(Coord, Coord) - Method in class com.github.yellowstonegames.path.CostlyGraph: Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findShortestPath(Coord, Coord) - Method in class com.github.yellowstonegames.path.DefaultGraph: Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findShortestPath(Coord, Coord, ObjectDeque, Heuristic) - Method in class com.github.yellowstonegames.path.CostlyGraph: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(Coord, Coord, ObjectDeque, Heuristic) - Method in class com.github.yellowstonegames.path.DefaultGraph: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(Coord, Coord, Heuristic) - Method in class com.github.yellowstonegames.path.CostlyGraph: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(Coord, Coord, Heuristic) - Method in class com.github.yellowstonegames.path.DefaultGraph: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(V, V) - Method in class com.github.yellowstonegames.path.Algorithms: Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
findShortestPath(V, V, ObjectDeque, Heuristic) - Method in class com.github.yellowstonegames.path.Algorithms: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findShortestPath(V, V, Heuristic) - Method in class com.github.yellowstonegames.path.Algorithms: Find the shortest path between the start and target vertices, using the A* search algorithm with the provided heuristic, and implemented with a priority queue.
findTechniquePath(int, Technique, float[][], LineDrawer, Collection, Collection, Coord, Collection) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, where goals are considered valid if they are at a valid range for the given Technique to hit at least one target and ideal if that Technique can affect as many targets as possible from a cell that can be moved to with at most movelength steps.
findTechniquePath(ObjectDeque, int, Technique, float[][], LineDrawer, Collection, Collection, Coord, Collection) - Method in class com.github.yellowstonegames.path.DijkstraMap: Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list of Coord positions (using the current measurement) needed to get closer to a goal, where goals are considered valid if they are at a valid range for the given Technique to hit at least one target and ideal if that Technique can affect as many targets as possible from a cell that can be moved to with at most movelength steps.
floodFill(int, Coord...) - Method in class com.github.yellowstonegames.path.DijkstraMap: A simple limited flood-fill that returns a OrderedMap of Coord keys to the float values in the DijkstraMap, only calculating out to a number of steps determined by limit.
floodFill(int, Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: A simple limited flood-fill that returns a OrderedMap of Coord keys to the float values in the DijkstraMap, only calculating out to a number of steps determined by limit.
FLOOR - Static variable in class com.github.yellowstonegames.path.DijkstraMap: Floor cells, which include any walkable cell, are marked with a high number equal to 999200f .
FREE - Enum constant in enum class com.github.yellowstonegames.path.technique.AimLimit
fresh - Variable in class com.github.yellowstonegames.path.DijkstraMap: Working data used during scanning, this tracks the perimeter of the scanned area so far.

G

generateAStarCostMap(char[][]) - Static method in class com.github.yellowstonegames.path.CostlyGraph: Given a char[][] for the map, produces a float[][] that can be used as a cost map by this class.
generateAStarCostMap(char[][], IntFloatMap, float) - Static method in class com.github.yellowstonegames.path.CostlyGraph: Given a char[][] for the map, a jdkgdxds IntFloatMap that maps chars in the map to their costs, and a float value for unhandled characters, produces a float[][] that can be used as a map by AStarSearch.
getA() - Method in class com.github.yellowstonegames.path.Connection
getA() - Method in class com.github.yellowstonegames.path.Edge
getAngle() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getB() - Method in class com.github.yellowstonegames.path.Connection
getB() - Method in class com.github.yellowstonegames.path.Edge
getBlockingRequirement() - Method in class com.github.yellowstonegames.path.DijkstraMap: If you want obstacles present in orthogonal cells to prevent pathfinding along the diagonal between them, this can be used to make thin diagonal walls non-viable to move through, or even to prevent diagonal movement if any one obstacle is orthogonally adjacent to both the start and target cell of a diagonal move.
getCenter() - Method in class com.github.yellowstonegames.path.technique.BurstAOE
getCenter() - Method in class com.github.yellowstonegames.path.technique.PointAOE
getConnections() - Method in class com.github.yellowstonegames.path.Node
getEdge(Node) - Method in class com.github.yellowstonegames.path.Node
getEdge(Node, Node) - Method in class com.github.yellowstonegames.path.Graph
getEdge(Node, Node) - Method in class com.github.yellowstonegames.path.UndirectedGraph
getEdge(V, V) - Method in class com.github.yellowstonegames.path.Graph: Retrieve the edge which is from v to w.
getEdgeCount() - Method in class com.github.yellowstonegames.path.Graph: Get the number of edges in the graph.
getEdges() - Method in class com.github.yellowstonegames.path.Graph: Get an ObjectOrderedSet containing all the edges in the graph.
getEdges(V) - Method in class com.github.yellowstonegames.path.Graph: Get a List containing all the edges which have v as a source.
getEnd() - Method in class com.github.yellowstonegames.path.technique.LineAOE
getHeight() - Method in class com.github.yellowstonegames.path.AStarSearch
getHeight() - Method in class com.github.yellowstonegames.path.TwistedLine
getInfluences() - Method in class com.github.yellowstonegames.path.ZoneOfInfluence: Gets the influencing groups; ideally the result should not be changed without setting it back with setInfluences.
getInternalNodeA() - Method in class com.github.yellowstonegames.path.Connection
getInternalNodeA() - Method in class com.github.yellowstonegames.path.Edge
getInternalNodeB() - Method in class com.github.yellowstonegames.path.Connection
getInternalNodeB() - Method in class com.github.yellowstonegames.path.Edge
getLastPath() - Method in class com.github.yellowstonegames.path.TwistedLine: Gets the last path this found, which may be empty.
getLimitType() - Method in interface com.github.yellowstonegames.path.technique.AOE: Gets the AimLimit enum that can be used to restrict points this checks (defaults to null if not set).
getLimitType() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getMappedCount() - Method in class com.github.yellowstonegames.path.DijkstraMap
getMaxRange() - Method in interface com.github.yellowstonegames.path.technique.AOE: The maximum inclusive range that the AOE can shift() to using the distance measurement from radiusType.
getMaxRange() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getMetric() - Method in interface com.github.yellowstonegames.path.technique.AOE: Used to determine distance from origin for the purposes of selecting a target location that is within the bounds of minRange and maxRange.
getMetric() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getMinRange() - Method in interface com.github.yellowstonegames.path.technique.AOE: The minimum inclusive range that the AOE can shift() to using the distance measurement from radiusType.
getMinRange() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getNode(V) - Method in class com.github.yellowstonegames.path.Graph
getNodeA() - Method in class com.github.yellowstonegames.path.Connection
getNodeB() - Method in class com.github.yellowstonegames.path.Connection
getNodes() - Method in class com.github.yellowstonegames.path.Graph
getObject() - Method in class com.github.yellowstonegames.path.Node
getOrigin() - Method in interface com.github.yellowstonegames.path.technique.AOE: Get the position from which the AOE originates, which may be related to the location of the AOE's effect, as for lines, cones, and other emitted effects, or may be unrelated except for determining which enemies can be seen or targeted from a given origin point (as for distant effects that radiate from a chosen central point, but have a maxRange at which they can deliver that effect).
getOrigin() - Method in class com.github.yellowstonegames.path.technique.BurstAOE
getOrigin() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getOrigin() - Method in class com.github.yellowstonegames.path.technique.LineAOE
getOrigin() - Method in class com.github.yellowstonegames.path.technique.PointAOE
getRadius() - Method in class com.github.yellowstonegames.path.technique.BurstAOE
getRadius() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getRadius() - Method in class com.github.yellowstonegames.path.technique.LineAOE
getRadiusType() - Method in class com.github.yellowstonegames.path.technique.BurstAOE
getRadiusType() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getRadiusType() - Method in class com.github.yellowstonegames.path.technique.LineAOE
getReach() - Method in interface com.github.yellowstonegames.path.technique.AOE: Gets the same values returned by getLimitType(), getMinRange(), getMaxRange(), and getMetric() bundled into one Reach object.
getReach() - Method in class com.github.yellowstonegames.path.technique.BurstAOE: Gets the same values returned by getLimitType(), getMinRange(), getMaxRange(), and getMetric() bundled into one Reach object.
getReach() - Method in class com.github.yellowstonegames.path.technique.ConeAOE: Gets the same values returned by getLimitType(), getMinRange(), getMaxRange(), and getMetric() bundled into one Reach object.
getReach() - Method in class com.github.yellowstonegames.path.technique.LineAOE: Gets the same values returned by getLimitType(), getMinRange(), getMaxRange(), and getMetric() bundled into one Reach object.
getReach() - Method in class com.github.yellowstonegames.path.technique.PointAOE: Gets the same values returned by getLimitType(), getMinRange(), getMaxRange(), and getMetric() bundled into one Reach object.
getRng() - Method in class com.github.yellowstonegames.path.TwistedLine
getSerializersNeeded() - Method in class com.github.yellowstonegames.path.CostlyGraph: Gets a List of Class instances that must each be registered with a serialization library before this object can be successfully serialized or deserialized.
getSerializersNeeded() - Method in class com.github.yellowstonegames.path.DefaultGraph: Gets a List of Class instances that must each be registered with a serialization library before this object can be successfully serialized or deserialized.
getSpan() - Method in class com.github.yellowstonegames.path.technique.ConeAOE
getVertices() - Method in class com.github.yellowstonegames.path.Graph: Get a Set containing all the vertices in the graph.
getWeight() - Method in class com.github.yellowstonegames.path.Connection
getWeight() - Method in class com.github.yellowstonegames.path.Edge
getWidth() - Method in class com.github.yellowstonegames.path.AStarSearch
getWidth() - Method in class com.github.yellowstonegames.path.TwistedLine
GOAL - Static variable in class com.github.yellowstonegames.path.DijkstraMap: Goals are by default marked with 0f.
goals - Variable in class com.github.yellowstonegames.path.DijkstraMap: Goals that pathfinding will seek out.
gradientMap - Variable in class com.github.yellowstonegames.path.DijkstraMap: The frequently-changing values that are often the point of using this class; goals will have a value of 0, and any cells that can have a character reach a goal in n steps will have a value of n.
graph - Variable in class com.github.yellowstonegames.path.AStarSearch
graph - Variable in class com.github.yellowstonegames.path.Node
graph - Variable in class com.github.yellowstonegames.path.TwistedLine
Graph<V> - Class in com.github.yellowstonegames.path: Abstract superclass of actual Graph types.
Graph() - Constructor for class com.github.yellowstonegames.path.Graph
Graph(Collection) - Constructor for class com.github.yellowstonegames.path.Graph
groups - Variable in class com.github.yellowstonegames.path.ZoneOfInfluence

H

hasEndpoint(V) - Method in class com.github.yellowstonegames.path.Edge
hasEndpoints(V, V) - Method in class com.github.yellowstonegames.path.Connection.DirectedConnection
hasEndpoints(V, V) - Method in class com.github.yellowstonegames.path.Connection.UndirectedConnection
hasEndpoints(V, V) - Method in class com.github.yellowstonegames.path.Edge
hashCode() - Method in class com.github.yellowstonegames.path.Connection.DirectedConnection
hashCode() - Method in class com.github.yellowstonegames.path.Connection.UndirectedConnection
hashCode() - Method in class com.github.yellowstonegames.path.CostlyGraph
hashCode() - Method in class com.github.yellowstonegames.path.DefaultGraph
hashCode() - Method in class com.github.yellowstonegames.path.Graph
hashCode() - Method in class com.github.yellowstonegames.path.Node
hashCode() - Method in class com.github.yellowstonegames.path.technique.Reach
hashCode() - Method in class com.github.yellowstonegames.path.technique.Threat
height - Variable in class com.github.yellowstonegames.path.AStarSearch
height - Variable in class com.github.yellowstonegames.path.CostlyGraph
height - Variable in class com.github.yellowstonegames.path.DefaultGraph
height - Variable in class com.github.yellowstonegames.path.DijkstraMap: Height of the map.
Heuristic<V> - Interface in com.github.yellowstonegames.path: A Heuristic generates estimates of the cost to move from a given node to the goal.
HEURISTICS - Static variable in interface com.github.yellowstonegames.path.Heuristic: An unmodifiable List of all the Heuristic implementations in this class.

I

i - Variable in class com.github.yellowstonegames.path.Node: Internal; a utility field used to store depth in some algorithms.
idealLocations(Coord, Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.Technique: Get a mapping of Coord keys representing locations to apply this Technique to, to ArrayList of Coord values representing which targets (by their location) are affected by choosing that Coord.
idealLocations(Coord, Set, Set, Set) - Method in class com.github.yellowstonegames.path.technique.Technique: Get a mapping of Coord keys representing locations to apply this Technique to, to ArrayList of Coord values representing which targets (by their location) are effected by choosing that Coord.
idealLocations(Collection, Collection) - Method in interface com.github.yellowstonegames.path.technique.AOE: Returns a OrderedMap of Coord keys and ArrayList of Coord values, where each Coord key is an ideal location to hit as many of the Points in targets as possible without hitting any Points in requiredExclusions, and each value is the collection of targets that will be hit if the associated key is used.
idealLocations(Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
idealLocations(Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
idealLocations(Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.LineAOE
idealLocations(Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.PointAOE
idealLocations(Collection, Collection, Collection) - Method in interface com.github.yellowstonegames.path.technique.AOE: A variant of idealLocations that takes two groups of desirable targets, and will rate locations by how many priorityTargets are in the AOE, then by how many lesserTargets are in the AOE, and will only consider locations that do not affect a Coord in requiredExclusions.
idealLocations(Collection, Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
idealLocations(Collection, Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
idealLocations(Collection, Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.LineAOE
idealLocations(Collection, Collection, Collection) - Method in class com.github.yellowstonegames.path.technique.PointAOE
increasing(float[][], Coord[]) - Method in class com.github.yellowstonegames.path.ZoneOfInfluence
inEdges - Variable in class com.github.yellowstonegames.path.Node
influences - Variable in class com.github.yellowstonegames.path.ZoneOfInfluence
init(char[][]) - Method in class com.github.yellowstonegames.path.DefaultGraph: Re-initializes a DefaultGraph from a 2D char array that uses '#' to represent any kind of inaccessible cell, with all other chars treated as walkable.
init(char[][], boolean) - Method in class com.github.yellowstonegames.path.DefaultGraph: Re-initializes this DefaultGraph from a 2D char array that uses '#' to represent any kind of inaccessible cell, with all other chars treated as walkable.
init(float[][]) - Method in class com.github.yellowstonegames.path.CostlyGraph: Re-initializes this DefaultGraph from a 2D float array that uses negative numbers to represent any kind of inaccessible cell, with all other numbers treated as possible to enter for a cost equal to that float.
init(float[][], boolean) - Method in class com.github.yellowstonegames.path.CostlyGraph: Re-initializes this DefaultGraph from a 2D float array that uses negative numbers to represent any kind of inaccessible cell, with all other numbers treated as possible to enter for a cost equal to that float.
initialize(char[][]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize or re-initialize a DijkstraMap that needs a new physicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initialize(char[][], char) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize or re-initialize a DijkstraMap that needs a new PhysicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initialize(float[][]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize or re-initialize a DijkstraMap that needs a new physicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initializeByResistance(float[][]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize or re-initialize a DijkstraMap that needs a new physicalMap because it either wasn't given one when it was constructed, or because the contents of the terrain have changed permanently (not if a creature moved; for that you pass the positions of creatures that block paths to scan() or findPath() ).
initializeCost(char[][]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize the entry cost modifiers for games that require variable costs to enter squares.
initializeCost(char[][], char) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize the entry cost modifiers for games that require variable costs to enter squares.
initializeCost(float[][]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Used to initialize the entry cost modifiers for games that require variable costs to enter squares.
isConnected(V, V) - Method in class com.github.yellowstonegames.path.Algorithms: Checks whether there exists a path from the start vertex to target vertex, using Dijkstra's algorithm implemented with a priority queue.
isDirected() - Method in class com.github.yellowstonegames.path.Graph: Check if the graph is directed, that is whether the edges form an ordered pair or a set.
isDirected() - Method in class com.github.yellowstonegames.path.UndirectedGraph

L

lastPath - Variable in class com.github.yellowstonegames.path.TwistedLine
lastRunID - Variable in class com.github.yellowstonegames.path.Node: Internal; a utility field used to distinguish which algorithm last used this Node.
lastRunID() - Method in class com.github.yellowstonegames.path.Algorithms: Gets the identifier for the last run of an algorithm; this should mostly be usable internally, but may be useful when different runs have affected a graph and a Node.lastRunID may need to be checked against this.
limit - Variable in class com.github.yellowstonegames.path.technique.Reach: An AimLimit enum that may be used to determine limitations to targeting cells; defaults to FREE (no limits other than those from distance), but can also be set to ORTHOGONAL (rook move in chess), DIAGONAL (bishop move in chess), EIGHT_WAY (queen or king move in chess), or null (which usually is equivalent to FREE).
line(int, int, int, int) - Method in class com.github.yellowstonegames.path.TwistedLine
line(Coord, Coord) - Method in class com.github.yellowstonegames.path.TwistedLine
LineAOE - Class in com.github.yellowstonegames.path.technique: Line Area of Effect that affects an slightly expanded (DDA) line from a given origin Coord to a given end Coord, plus an optional radius of cells around the path of the line, while respecting obstacles in its path and possibly stopping if obstructed.
LineAOE(Coord, Coord) - Constructor for class com.github.yellowstonegames.path.technique.LineAOE
LineAOE(Coord, Coord, int) - Constructor for class com.github.yellowstonegames.path.technique.LineAOE
LineAOE(Coord, Coord, int, Radius) - Constructor for class com.github.yellowstonegames.path.technique.LineAOE
LineAOE(Coord, Coord, int, Radius, int, int) - Constructor for class com.github.yellowstonegames.path.technique.LineAOE

M

MANHATTAN - Static variable in interface com.github.yellowstonegames.path.Heuristic: A predefined Heuristic for Coord nodes in a 2D plane where diagonal movement is estimated as costing twice as much as orthogonal movement.
map - Variable in class com.github.yellowstonegames.path.technique.Technique
maxDistance - Variable in class com.github.yellowstonegames.path.technique.Reach: The maximum distance in cells that this Reach can target.
mayContainTarget(Collection) - Method in interface com.github.yellowstonegames.path.technique.AOE: Given a Set of Points that the producer of the AOE wants to include in the region of this AOE, this method does a quick approximation to see if there is any possibility that the AOE as currently configured might include one of those Points within itself.
mayContainTarget(Collection) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
mayContainTarget(Collection) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
mayContainTarget(Collection) - Method in class com.github.yellowstonegames.path.technique.LineAOE
mayContainTarget(Collection) - Method in class com.github.yellowstonegames.path.technique.PointAOE
measurement - Variable in class com.github.yellowstonegames.path.DijkstraMap: This affects how distance is measured on diagonal directions vs.
metric - Variable in class com.github.yellowstonegames.path.technique.Reach: Determines how distance will be measured.
minDistance - Variable in class com.github.yellowstonegames.path.technique.Reach: The minimum distance in cells that this Reach can target.

N

name - Variable in class com.github.yellowstonegames.path.technique.Technique
nearestInfluences(Coord) - Method in class com.github.yellowstonegames.path.ZoneOfInfluence: This can be given a Coord to check in the results of the latest calculate() call.
nearestInfluences(Region[], Coord) - Method in class com.github.yellowstonegames.path.ZoneOfInfluence: Given the zones resulting from this class' ZoneOfInfluence.calculate() method and a Coord to check, finds the indices of all influencing groups in zones that have the Coord in their area, and returns all such indices as a newly-allocated IntList.
neighbors - Variable in class com.github.yellowstonegames.path.Node
Node<V> - Class in com.github.yellowstonegames.path: An extended version of BinaryHeap.Node that also stores a reference to the parent Graph, a vertex object of type V, a Map of neighbor Nodes to the appropriate Connection per Node, an extra List of those same Connections for faster iteration, and a lot of internal data used by algorithms in this package.
Node(V, Graph) - Constructor for class com.github.yellowstonegames.path.Node

O

object - Variable in class com.github.yellowstonegames.path.Node
obtainEdge() - Method in class com.github.yellowstonegames.path.DirectedGraph
obtainEdge() - Method in class com.github.yellowstonegames.path.Graph
obtainEdge() - Method in class com.github.yellowstonegames.path.UndirectedGraph
ORTHOGONAL - Enum constant in enum class com.github.yellowstonegames.path.technique.AimLimit
outEdges - Variable in class com.github.yellowstonegames.path.Node

P

partialScan(int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map up to a limit and return it.
partialScan(int, Coord, Iterable, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map for a creature that is potentially larger than 1x1 cell and return it.
partialScan(int, Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map up to a limit and return it.
partialScan(int, Iterable, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map for a creature that is potentially larger than 1x1 cell and return it.
partialScan(Coord, int, Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map up to a limit and return it.
partialScan(Coord, int, Iterable, boolean) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map up to a limit and return it.
path - Variable in class com.github.yellowstonegames.path.AStarSearch
path - Variable in class com.github.yellowstonegames.path.DijkstraMap: The latest path that was obtained by calling findPath().
path(int, int, int, int) - Method in class com.github.yellowstonegames.path.AStarSearch: Finds an A* path to the target from the start.
path(Coord, Coord) - Method in class com.github.yellowstonegames.path.AStarSearch: Finds an A* path to the target from the start.
physicalMap - Variable in class com.github.yellowstonegames.path.DijkstraMap: Stores which parts of the map are accessible and which are not.
PointAOE - Class in com.github.yellowstonegames.path.technique: An AOE type that has a center Coord only and only affects that single Coord.
PointAOE(Coord) - Constructor for class com.github.yellowstonegames.path.technique.PointAOE
PointAOE(Coord, int, int) - Constructor for class com.github.yellowstonegames.path.technique.PointAOE
position - Variable in class com.github.yellowstonegames.path.technique.Threat
possibleTargets(Coord) - Method in class com.github.yellowstonegames.path.technique.Technique: Gets all possible target-able Coords when using this technique from the given Coord user, returning them in a Region.
possibleTargets(Coord, float[][]) - Method in class com.github.yellowstonegames.path.technique.Technique: Gets all possible target-able Coords when using this technique from the given Coord user, returning them in a Region.
prev - Variable in class com.github.yellowstonegames.path.Node: Internal; a reference to the previous Node in a BinaryHeap.

R

radius - Variable in class com.github.yellowstonegames.path.ZoneOfInfluence
randomize() - Method in class com.github.yellowstonegames.path.TwistedLine: Called automatically during construction, this sets up a random maze as a DefaultGraph so a path can be found.
reach - Variable in class com.github.yellowstonegames.path.technique.Threat
Reach - Class in com.github.yellowstonegames.path.technique: A struct-like class that holds information about targeting rules for actions or other effects that reach from one square into another one, with certain potential restrictions.
Reach() - Constructor for class com.github.yellowstonegames.path.technique.Reach: Constructs a Reach with all fields given default values; maxDistance is set to 1, minDistance is set to 0, limit is set to AimLimit.FREE, and metric is set to Radius.SQUARE (8-way movement).
Reach(int) - Constructor for class com.github.yellowstonegames.path.technique.Reach: Constructs a Reach with the specified maxDistance, to a minimum of 0.
Reach(int, int) - Constructor for class com.github.yellowstonegames.path.technique.Reach: Constructs a Reach with the specified minDistance, to a minimum of 0, and maxDistance, to a minimum equal to minDistance (after factoring in any change to meet the minimum of 0).
Reach(int, int, Radius) - Constructor for class com.github.yellowstonegames.path.technique.Reach: Constructs a Reach with the specified minDistance, to a minimum of 0, maxDistance, to a minimum equal to minDistance (after factoring in any change to meet the minimum of 0), and distance calculation metric as a Radius enum.
Reach(int, int, Radius, AimLimit) - Constructor for class com.github.yellowstonegames.path.technique.Reach: Constructs a Reach with the specified minDistance, to a minimum of 0, maxDistance, to a minimum equal to minDistance (after factoring in any change to meet the minimum of 0), and distance calculation metric as a Radius enum.
readExternal(ObjectInput) - Method in class com.github.yellowstonegames.path.CostlyGraph: Meant for deserialization using Fory.
readExternal(ObjectInput) - Method in class com.github.yellowstonegames.path.DefaultGraph: Meant for deserialization using Fory.
readExternal(ObjectInput) - Method in class com.github.yellowstonegames.path.Graph: Meant for deserialization using Fory.
reinitialize() - Method in class com.github.yellowstonegames.path.TwistedLine: Called automatically during construction, this sets up a random maze as a DefaultGraph so a path can be found.
reinitialize(char[][], Heuristic) - Method in class com.github.yellowstonegames.path.AStarSearch: Resets this pathing object to use a different map and optionally a different Heuristic.
reinitialize(float[][], Heuristic) - Method in class com.github.yellowstonegames.path.AStarSearch: Resets this pathing object to use a different map and optionally a different Heuristic.
reinitialize(Coord[]) - Method in class com.github.yellowstonegames.path.TwistedLine: This sets up a random maze as a DefaultGraph so a path can be found, using the given array of Coord to represent which cells on a 2D grid can actually be traversed (and so can be used in a random path).
reinitialize(Collection) - Method in class com.github.yellowstonegames.path.TwistedLine: This sets up a random maze as a DefaultGraph so a path can be found, using the given Collection of Coord to represent which cells on a 2D grid can actually be traversed (and so can be used in a random path).
removeAllEdges() - Method in class com.github.yellowstonegames.path.Graph: Removes all edges from the graph.
removeAllVertices() - Method in class com.github.yellowstonegames.path.Graph: Removes all vertices and edges from the graph.
removeConnection(Node, Node) - Method in class com.github.yellowstonegames.path.Graph
removeConnection(Node, Node) - Method in class com.github.yellowstonegames.path.UndirectedGraph
removeEdge(Edge) - Method in class com.github.yellowstonegames.path.Graph
removeEdge(Node) - Method in class com.github.yellowstonegames.path.Node
removeEdge(V, V) - Method in class com.github.yellowstonegames.path.Graph: Removes the edge from v to w from the graph.
removeEdgeIf(ObjPredicate) - Method in class com.github.yellowstonegames.path.Graph
removeEdges(Collection) - Method in class com.github.yellowstonegames.path.Graph
removeNode(Node) - Method in class com.github.yellowstonegames.path.Graph
removeVertex(V) - Method in class com.github.yellowstonegames.path.Graph: Removes a vertex from the graph, and any adjacent edges.
removeVertexIf(ObjPredicate) - Method in class com.github.yellowstonegames.path.Graph
removeVertices(Collection) - Method in class com.github.yellowstonegames.path.Graph: Removes all the vertices in the collection from the graph, and any adjacent edges.
reset() - Method in class com.github.yellowstonegames.path.DijkstraMap: Resets this DijkstraMap to a state with no goals, no discovered path, and no changes made to gradientMap relative to physicalMap.
resetAlgorithmAttributes(int) - Method in class com.github.yellowstonegames.path.Node: If runID is not equal to Node.lastRunID, this resets the internal fields Node.visited, Node.seen, Node.distance, Node.estimate, Node.prev, and Node.i, then sets Node.lastRunID to runID.
resetCell(int, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Reverts a cell to the value stored in the original state of the level as known by physicalMap.
resetCell(Coord) - Method in class com.github.yellowstonegames.path.DijkstraMap: Reverts a cell to the value stored in the original state of the level as known by physicalMap.
resetMap() - Method in class com.github.yellowstonegames.path.DijkstraMap: Resets the gradientMap to its original value from physicalMap.
resetTargetMap() - Method in class com.github.yellowstonegames.path.DijkstraMap: Resets the targetMap (which is only assigned in the first place if you use findTechniquePath() ).
rng - Variable in class com.github.yellowstonegames.path.DijkstraMap: The FlowRandom used to decide which one of multiple equally-short paths to take; this has its state set deterministically before any usage.
rng - Variable in class com.github.yellowstonegames.path.TwistedLine

S

scan() - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map and return it.
scan(Coord, Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map and return it.
scan(Coord, Iterable, boolean) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map and return it.
scan(Coord, Iterable, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map for a creature that is potentially larger than 1x1 cell and return it.
scan(Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map and return it.
scan(Iterable, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Recalculate the Dijkstra map for a creature that is potentially larger than 1x1 cell and return it.
seen - Variable in class com.github.yellowstonegames.path.Node: Internal; tracking bit for whether this Node has been checked during the current algorithm.
set(Node, Node, float) - Method in class com.github.yellowstonegames.path.Connection
set(Node, Node, float) - Method in class com.github.yellowstonegames.path.Edge
setAngle(float) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setBlockingRequirement(int) - Method in class com.github.yellowstonegames.path.DijkstraMap: If you want obstacles present in orthogonal cells to prevent pathfinding along the diagonal between them, this can be used to make thin diagonal walls non-viable to move through, or even to prevent diagonal movement if any one obstacle is orthogonally adjacent to both the start and target cell of a diagonal move.
setCenter(Coord) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
setCenter(Coord) - Method in class com.github.yellowstonegames.path.technique.PointAOE
setCost(int, int, float) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks a cell's cost for pathfinding as cost, unless the cell is a wall or unreachable area (then it always sets the cost to the value of the WALL field).
setCost(Coord, float) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks a cell's cost for pathfinding as cost, unless the cell is a wall or unreachable area (then it always sets the cost to the value of the WALL field).
setEnd(Coord) - Method in class com.github.yellowstonegames.path.technique.LineAOE
setEndCenter(Coord) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setGoal(int, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks a cell as a goal for pathfinding, unless the cell is a wall or unreachable area (then it does nothing).
setGoal(Coord) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks a cell as a goal for pathfinding, unless the cell is a wall or unreachable area (then it does nothing).
setGoals(Coord[]) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks many cells as goals for pathfinding, ignoring cells in walls or unreachable areas.
setGoals(Region) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks many cells as goals for pathfinding, ignoring cells in walls or unreachable areas.
setGoals(Iterable) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks many cells as goals for pathfinding, ignoring cells in walls or unreachable areas.
setInfluences(Coord[][]) - Method in class com.github.yellowstonegames.path.ZoneOfInfluence: Changes the influencing groups.
setLimitType(AimLimit) - Method in interface com.github.yellowstonegames.path.technique.AOE: You can use limitType to restrict any Points that might be processed based on the given origin (which will be used as the geometric origin for any calculations this makes) with AimLimit values having the following meanings: AimLimit.FREE makes no restrictions; it is equivalent here to passing null for limit. AimLimit.EIGHT_WAY will only consider Points to be valid targets if they are along a straight line with an angle that is a multiple of 45 degrees, relative to the positive x axis.
setLimitType(AimLimit) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setMap(char[][]) - Method in class com.github.yellowstonegames.path.technique.Technique: VITAL: Call this method before any calls to idealLocations() or apply(), and call it again if the map changes.
setMap(float[][]) - Method in interface com.github.yellowstonegames.path.technique.AOE: This must be called before any other methods, and takes a float[][] with 1.0 or higher for walls, and anything lower for passable cells.
setMap(float[][]) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
setMap(float[][]) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setMap(float[][]) - Method in class com.github.yellowstonegames.path.technique.LineAOE
setMap(float[][]) - Method in class com.github.yellowstonegames.path.technique.PointAOE
setMap(float[][]) - Method in class com.github.yellowstonegames.path.technique.Technique: VITAL: Call this method before any calls to idealLocations() or apply(), and call it again if the map changes.
setMaxRange(int) - Method in interface com.github.yellowstonegames.path.technique.AOE: The maximum inclusive range that the AOE can shift() to using the distance measurement from radiusType.
setMaxRange(int) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setMetric(Radius) - Method in interface com.github.yellowstonegames.path.technique.AOE: Used to determine distance from origin for the purposes of selecting a target location that is within the bounds of minRange and maxRange.
setMetric(Radius) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setMinRange(int) - Method in interface com.github.yellowstonegames.path.technique.AOE: The minimum inclusive range that the AOE can shift() to using the distance measurement from radiusType.
setMinRange(int) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setOccupied(int, int) - Method in class com.github.yellowstonegames.path.DijkstraMap: Marks a specific cell in gradientMap as completely impossible to enter.
setOrigin(Coord) - Method in interface com.github.yellowstonegames.path.technique.AOE: Set the position from which the AOE originates, which may be related to the location of the AOE's effect, as for lines, cones, and other emitted effects, or may be unrelated except for determining which enemies can be seen or targeted from a given origin point (as for distant effects that radiate from a chosen central point, but have a maxRange at which they can deliver that effect).
setOrigin(Coord) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
setOrigin(Coord) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setOrigin(Coord) - Method in class com.github.yellowstonegames.path.technique.LineAOE
setOrigin(Coord) - Method in class com.github.yellowstonegames.path.technique.PointAOE
setRadius(float) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setRadius(int) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
setRadius(int) - Method in class com.github.yellowstonegames.path.technique.LineAOE
setRadiusType(Radius) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
setRadiusType(Radius) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setRadiusType(Radius) - Method in class com.github.yellowstonegames.path.technique.LineAOE
setReach(Reach) - Method in interface com.github.yellowstonegames.path.technique.AOE: Sets the same values as setLimitType(), setMinRange(), setMaxRange(), and setMetric() using one Reach object.
setReach(Reach) - Method in class com.github.yellowstonegames.path.technique.BurstAOE: Sets the same values as setLimitType(), setMinRange(), setMaxRange(), and setMetric() using one Reach object.
setReach(Reach) - Method in class com.github.yellowstonegames.path.technique.ConeAOE: Sets the same values as setLimitType(), setMinRange(), setMaxRange(), and setMetric() using one Reach object.
setReach(Reach) - Method in class com.github.yellowstonegames.path.technique.LineAOE: Sets the same values as setLimitType(), setMinRange(), setMaxRange(), and setMetric() using one Reach object.
setReach(Reach) - Method in class com.github.yellowstonegames.path.technique.PointAOE: Sets the same values as setLimitType(), setMinRange(), setMaxRange(), and setMetric() using one Reach object.
setRng(EnhancedRandom) - Method in class com.github.yellowstonegames.path.TwistedLine
setRunID(int) - Method in class com.github.yellowstonegames.path.Algorithms: Sets the identifier for the last run of an algorithm; this should mostly be usable internally, but may be useful when serializing and deserializing a Graph and you, for whatever reason, need to ensure previous runs of an algorithm on that Graph can be resumed.
setSpan(float) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
setWeight(float) - Method in class com.github.yellowstonegames.path.Connection
setWeight(float) - Method in class com.github.yellowstonegames.path.Edge
shift(Coord) - Method in interface com.github.yellowstonegames.path.technique.AOE: After an AOE has been constructed, it may need to have the affected area shifted over to a different position without changing any other properties of the AOE.
shift(Coord) - Method in class com.github.yellowstonegames.path.technique.BurstAOE
shift(Coord) - Method in class com.github.yellowstonegames.path.technique.ConeAOE
shift(Coord) - Method in class com.github.yellowstonegames.path.technique.LineAOE
shift(Coord) - Method in class com.github.yellowstonegames.path.technique.PointAOE
show() - Method in class com.github.yellowstonegames.path.CostlyGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
show() - Method in class com.github.yellowstonegames.path.DefaultGraph: Creates a 1D char array (which can be passed to String.valueOf(char[])) filled with a grid made of the vertices in this Graph and their estimated costs, if this has done an estimate.
size() - Method in class com.github.yellowstonegames.path.Graph: Get the number of vertices in the graph.
sortEdges(Comparator) - Method in class com.github.yellowstonegames.path.Graph: Sort the edges using the provided comparator.
sortVertices(Comparator) - Method in class com.github.yellowstonegames.path.Graph: Sort the vertices using the provided comparator.
standardCosts - Variable in class com.github.yellowstonegames.path.DijkstraMap
start - Variable in class com.github.yellowstonegames.path.AStarSearch

T

target - Variable in class com.github.yellowstonegames.path.AStarSearch
targetMap - Variable in class com.github.yellowstonegames.path.DijkstraMap
Technique - Class in com.github.yellowstonegames.path.technique: A simple struct-like class that stores various public fields which describe the targeting properties of a skill, spell, tech, or any other game-specific term for a targeted (typically offensive) ability we call a Technique.
Technique() - Constructor for class com.github.yellowstonegames.path.technique.Technique: Creates a Technique that can target any adjacent single Coord, using Chebyshev (8-way square) distance.
Technique(String) - Constructor for class com.github.yellowstonegames.path.technique.Technique: Creates a Technique that can target any adjacent single Coord, using Chebyshev (8-way square) distance.
Technique(String, AOE) - Constructor for class com.github.yellowstonegames.path.technique.Technique: Creates a Technique that can target a Coord at a range specified by the given AOE's minRange and maxRange, using a distance metric from the AOE, and use that target Coord for the given AOE.
Technique(String, Object, AOE) - Constructor for class com.github.yellowstonegames.path.technique.Technique: Creates a Technique that can target a Coord at a range specified by the given AOE's minRange and maxRange, using a distance metric from the AOE, and use that target Coord for the given AOE.
Threat - Class in com.github.yellowstonegames.path.technique: A small class to store the area that a creature is perceived by other creatures to threaten.
Threat(Coord, int) - Constructor for class com.github.yellowstonegames.path.technique.Threat
Threat(Coord, int, int) - Constructor for class com.github.yellowstonegames.path.technique.Threat
Threat(Coord, int, int, Radius) - Constructor for class com.github.yellowstonegames.path.technique.Threat
Threat(Coord, int, int, Radius, AimLimit) - Constructor for class com.github.yellowstonegames.path.technique.Threat
topologicalSort() - Method in class com.github.yellowstonegames.path.CostlyGraph: Sort the vertices of this graph in topological order.
topologicalSort() - Method in class com.github.yellowstonegames.path.DirectedGraphAlgorithms: Sort the vertices of this graph in topological order.
topologicalSort(ObjectList) - Method in class com.github.yellowstonegames.path.CostlyGraph: Perform a topological sort on the graph, and puts the sorted vertices in the supplied list.
topologicalSort(ObjectList) - Method in class com.github.yellowstonegames.path.DirectedGraphAlgorithms: Perform a topological sort on the graph, and puts the sorted vertices in the supplied list.
toString() - Method in class com.github.yellowstonegames.path.AStarSearch
toString() - Method in class com.github.yellowstonegames.path.Connection.DirectedConnection
toString() - Method in class com.github.yellowstonegames.path.Connection.UndirectedConnection
toString() - Method in class com.github.yellowstonegames.path.CostlyGraph
toString() - Method in class com.github.yellowstonegames.path.DefaultGraph
toString() - Method in class com.github.yellowstonegames.path.DirectedGraph
toString() - Method in class com.github.yellowstonegames.path.Node
toString() - Method in class com.github.yellowstonegames.path.technique.Reach
toString() - Method in class com.github.yellowstonegames.path.technique.Threat
toString() - Method in class com.github.yellowstonegames.path.UndirectedGraph
TwistedLine - Class in com.github.yellowstonegames.path: Like DrunkenWalk, this generates orthogonally-connected paths of Coord that meander through an area; unlike DrunkenWalk, this won't ever generate paths that cross themselves.
TwistedLine() - Constructor for class com.github.yellowstonegames.path.TwistedLine
TwistedLine(int, int) - Constructor for class com.github.yellowstonegames.path.TwistedLine
TwistedLine(int, int, EnhancedRandom) - Constructor for class com.github.yellowstonegames.path.TwistedLine
TwistedLine(int, int, EnhancedRandom, Coord[]) - Constructor for class com.github.yellowstonegames.path.TwistedLine
TwistedLine(int, int, EnhancedRandom, Collection) - Constructor for class com.github.yellowstonegames.path.TwistedLine
type - Variable in class com.github.yellowstonegames.path.AStarSearch

U

UndirectedConnection() - Constructor for class com.github.yellowstonegames.path.Connection.UndirectedConnection
UndirectedGraph<V> - Class in com.github.yellowstonegames.path: A kind of Graph where all connections between vertices are two-way and have equal cost for traveling A to B or B to A.
UndirectedGraph() - Constructor for class com.github.yellowstonegames.path.UndirectedGraph
UndirectedGraph(Collection) - Constructor for class com.github.yellowstonegames.path.UndirectedGraph
UndirectedGraphAlgorithms<V> - Class in com.github.yellowstonegames.path: Algorithms specific to undirected graphs, like DefaultGraph, as well as general Algorithms.
userData - Variable in class com.github.yellowstonegames.path.technique.Technique

V

valueOf(String) - Static method in enum class com.github.yellowstonegames.path.technique.AimLimit: Returns the enum constant of this class with the specified name.
values() - Static method in enum class com.github.yellowstonegames.path.technique.AimLimit: Returns an array containing the constants of this enum class, in the order they are declared.
verifyLimit(AimLimit, Coord, Coord) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: Checks that the given end Coord can be targeted from the given origin Coord given the directional targeting rules specified by limit.
verifyReach(Reach, Coord, Coord) - Static method in class com.github.yellowstonegames.path.technique.AreaUtils: Checks that the given end Coord can be targeted from the given origin Coord given the complete targeting rules specified by reach.
vertexMap - Variable in class com.github.yellowstonegames.path.Graph
visited - Variable in class com.github.yellowstonegames.path.Node: Internal; tracking bit for whether this Node has already been visited during the current algorithm.

W

WALL - Static variable in class com.github.yellowstonegames.path.DijkstraMap: Walls, which are solid no-entry cells, are marked with a high number equal to 999500f .
weight - Variable in class com.github.yellowstonegames.path.Connection
width - Variable in class com.github.yellowstonegames.path.AStarSearch
width - Variable in class com.github.yellowstonegames.path.CostlyGraph
width - Variable in class com.github.yellowstonegames.path.DefaultGraph
width - Variable in class com.github.yellowstonegames.path.DijkstraMap: Width of the map.
writeExternal(ObjectOutput) - Method in class com.github.yellowstonegames.path.CostlyGraph: Meant for serialization using Fory.
writeExternal(ObjectOutput) - Method in class com.github.yellowstonegames.path.DefaultGraph: Meant for serialization using Fory.
writeExternal(ObjectOutput) - Method in class com.github.yellowstonegames.path.Graph: Meant for serialization using Fory.

Z

ZoneOfInfluence - Class in com.github.yellowstonegames.path: Calculates the Zone of Influence, also known as Zone of Control, for different points on a map.
ZoneOfInfluence(Coord[][], char[][], Radius) - Constructor for class com.github.yellowstonegames.path.ZoneOfInfluence: Constructs a Zone of Influence map.
ZoneOfInfluence(Coord[], char[][], Radius) - Constructor for class com.github.yellowstonegames.path.ZoneOfInfluence: Constructs a Zone of Influence map.
ZoneOfInfluence(Collection, char[][], Radius) - Constructor for class com.github.yellowstonegames.path.ZoneOfInfluence: Constructs a Zone of Influence map.

A B C D E F G H I L M N O P R S T U V W Z
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form