Uses of Package
squidpony.squidai.graph

Packages that use squidpony.squidai.graph

Package	Description
squidpony.squidai.graph	Graphs and graph algorithms used primarily (but not exclusively) for pathfinding.
squidpony.squidmath	A very broad package containing random number generators, geometry tools, data structures, and noise functions.

Classes in squidpony.squidai.graph used by squidpony.squidai.graph

Class	Description
Algorithms	Most of the algorithms that operate on a Graph are defined here, with some specific cases in subclasses.
Connection	The most-commonly-used class that represents an edge between nodes on a Graph.
DirectedGraph	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.
DirectedGraphAlgorithms	Algorithms specific to directed graphs, like CostlyGraph, as well as general Algorithms.
Edge	Abstract superclass of any connection between nodes on a graph.
Graph	Abstract superclass of actual Graph types, like DirectedGraph and UndirectedGraph.
Heuristic	A Heuristic generates estimates of the cost to move from a given node to the goal.
Node	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.
UndirectedGraph	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.
UndirectedGraphAlgorithms	Algorithms specific to undirected graphs, like DefaultGraph, as well as general Algorithms.

Classes in squidpony.squidai.graph used by squidpony.squidmath

Class	Description
CostlyGraph	A default setting for a DirectedGraph of Coord vertices where each passable cell has a cost to enter it from any passable neighbor.
DefaultGraph	A default setting for an UndirectedGraph of Coord vertices where all connections have cost 1.