Package | Description |
---|---|
squidpony.squidai.graph |
Graphs and graph algorithms used primarily (but not exclusively) for pathfinding.
|
Modifier and Type | Class and Description |
---|---|
class |
CostlyGraph
A default setting for a DirectedGraph of Coord vertices where each passable cell has a cost to enter it from any
passable neighbor.
|
class |
DefaultGraph
A default setting for an
UndirectedGraph of Coord vertices where all connections have cost 1. |
class |
DirectedGraph<V>
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. |
class |
UndirectedGraph<V>
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. |
Modifier and Type | Field and Description |
---|---|
protected Graph<V> |
Node.graph |
Modifier and Type | Method and Description |
---|---|
Graph<Coord> |
CostlyGraph.breadthFirstSearch(Coord coord)
Perform a breadth first search starting from the specified vertex.
|
Graph<Coord> |
DefaultGraph.breadthFirstSearch(Coord coord)
Perform a breadth first search starting from the specified vertex.
|
Graph<Coord> |
CostlyGraph.breadthFirstSearch(Coord coord,
int maxVertices,
int maxDepth)
Perform a breadth first search starting from the specified vertex.
|
Graph<Coord> |
DefaultGraph.breadthFirstSearch(Coord coord,
int maxVertices,
int maxDepth)
Perform a breadth first search starting from the specified vertex.
|
Graph<V> |
Algorithms.breadthFirstSearch(V v)
Perform a breadth first search starting from the specified vertex.
|
Graph<V> |
Algorithms.breadthFirstSearch(V v,
int maxVertices,
int maxDepth)
Perform a breadth first search starting from the specified vertex.
|
protected Graph<V> |
DirectedGraph.createNew() |
protected abstract Graph<V> |
Graph.createNew() |
protected Graph<V> |
UndirectedGraph.createNew() |
Graph<Coord> |
CostlyGraph.depthFirstSearch(Coord coord)
Perform a depth first search starting from the specified vertex.
|
Graph<Coord> |
DefaultGraph.depthFirstSearch(Coord coord)
Perform a depth first search starting from the specified vertex.
|
Graph<Coord> |
CostlyGraph.depthFirstSearch(Coord coord,
int maxVertices,
int maxDepth)
Perform a depth first search starting from the specified vertex.
|
Graph<Coord> |
DefaultGraph.depthFirstSearch(Coord coord,
int maxVertices,
int maxDepth)
Perform a depth first search starting from the specified vertex.
|
Graph<V> |
Algorithms.depthFirstSearch(V v)
Perform a depth first search starting from the specified vertex.
|
Graph<V> |
Algorithms.depthFirstSearch(V v,
int maxVertices,
int maxDepth)
Perform a depth first search starting from the specified vertex.
|
Graph<Coord> |
DefaultGraph.findMinimumWeightSpanningTree()
Find a minimum weight spanning tree using Kruskal's algorithm.
|
Graph<V> |
UndirectedGraphAlgorithms.findMinimumWeightSpanningTree()
Find a minimum weight spanning tree using Kruskal's algorithm.
|
Constructor and Description |
---|
Node(V v,
Graph<V> graph) |
Copyright © Eben Howard 2012–2022. All rights reserved.