Package | Description |
---|---|
squidpony.squidai.graph |
Graphs and graph algorithms used primarily (but not exclusively) for pathfinding.
|
Modifier and Type | Field and Description |
---|---|
protected Node<V> |
Connection.a |
protected Node<V> |
Connection.b |
protected Node<V> |
Node.prev
Internal; a reference to the previous Node in a BinaryHeap.
|
Modifier and Type | Field and Description |
---|---|
protected java.util.HashMap<Node<V>,Connection<V>> |
Node.neighbors |
protected OrderedMap<V,Node<V>> |
Graph.vertexMap |
Modifier and Type | Method and Description |
---|---|
protected Node<V> |
Connection.getInternalNodeA() |
protected abstract Node<V> |
Edge.getInternalNodeA() |
protected Node<V> |
Connection.getInternalNodeB() |
protected abstract Node<V> |
Edge.getInternalNodeB() |
protected Node<V> |
Graph.getNode(V v) |
Node<V> |
Connection.getNodeA() |
Node<V> |
Connection.getNodeB() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Collection<Node<V>> |
Graph.getNodes() |
Modifier and Type | Method and Description |
---|---|
protected Connection<V> |
Graph.addConnection(Node<V> a,
Node<V> b) |
protected Connection<V> |
Graph.addConnection(Node<V> a,
Node<V> b) |
protected Connection<V> |
Graph.addConnection(Node<V> a,
Node<V> b,
float weight) |
protected Connection<V> |
Graph.addConnection(Node<V> a,
Node<V> b,
float weight) |
protected Connection<V> |
UndirectedGraph.addConnection(Node<V> a,
Node<V> b,
float weight) |
protected Connection<V> |
UndirectedGraph.addConnection(Node<V> a,
Node<V> b,
float weight) |
protected Connection<V> |
Node.addEdge(Node<V> v,
float weight) |
protected boolean |
Graph.connectionExists(Node<V> u,
Node<V> v) |
protected boolean |
Graph.connectionExists(Node<V> u,
Node<V> v) |
protected Connection<V> |
Node.getEdge(Node<V> v) |
protected Connection<V> |
Graph.getEdge(Node<V> a,
Node<V> b) |
protected Connection<V> |
Graph.getEdge(Node<V> a,
Node<V> b) |
protected Connection<V> |
UndirectedGraph.getEdge(Node<V> a,
Node<V> b) |
protected Connection<V> |
UndirectedGraph.getEdge(Node<V> a,
Node<V> b) |
protected boolean |
Graph.removeConnection(Node<V> a,
Node<V> b) |
protected boolean |
Graph.removeConnection(Node<V> a,
Node<V> b) |
protected boolean |
UndirectedGraph.removeConnection(Node<V> a,
Node<V> b) |
protected boolean |
UndirectedGraph.removeConnection(Node<V> a,
Node<V> b) |
protected Connection<V> |
Node.removeEdge(Node<V> v) |
protected void |
Graph.removeNode(Node<V> node) |
protected void |
Connection.set(Node<V> a,
Node<V> b,
float weight) |
protected void |
Connection.set(Node<V> a,
Node<V> b,
float weight) |
protected abstract void |
Edge.set(Node<V> a,
Node<V> b,
float weight) |
protected abstract void |
Edge.set(Node<V> a,
Node<V> b,
float weight) |
Constructor and Description |
---|
Connection(Node<V> a,
Node<V> b) |
Connection(Node<V> a,
Node<V> b) |
Connection(Node<V> a,
Node<V> b,
float weight) |
Connection(Node<V> a,
Node<V> b,
float weight) |
Copyright © Eben Howard 2012–2022. All rights reserved.