public class Graph
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
java.util.List<Edge> |
edges
The edges.
|
java.util.Map<java.lang.String,Node> |
nodes
The nodes.
|
Constructor and Description |
---|
Graph()
Instantiates a new graph.
|
Modifier and Type | Method and Description |
---|---|
Edge |
connect(java.lang.String a,
java.lang.String b)
Connect.
|
void |
forceConnect(java.lang.String a,
java.lang.String b)
Force connect.
|
java.util.List<Edge> |
getEdges()
Gets the edges.
|
java.util.List<Edge> |
getEdgesLongerThanDistanceIgnoringCurrentlyInteractingEdges(float distance)
Gets the edges longer than distance ignoring currently interacting edges.
|
Node |
getNodeForItem(java.lang.String item)
Gets the node for item.
|
java.util.Map<java.lang.String,Node> |
getNodes()
Gets the nodes.
|
boolean |
isConnected(java.lang.String a,
java.lang.String b)
Checks if is connected.
|
void |
pressedOn(java.lang.String itemID)
When a node is pressed on, we want to ignore it during our clever
moving-about-type-algorithm.
|
void |
releasedOn(java.lang.String itemID)
Released on.
|
boolean |
removeEdges(java.util.List<Edge> collection)
Removes the edges.
|
public java.util.List<Edge> edges
public java.util.Map<java.lang.String,Node> nodes
public Edge connect(java.lang.String a, java.lang.String b)
a
- the ab
- the bpublic void forceConnect(java.lang.String a, java.lang.String b)
a
- the ab
- the bpublic java.util.List<Edge> getEdges()
public java.util.List<Edge> getEdgesLongerThanDistanceIgnoringCurrentlyInteractingEdges(float distance)
distance
- the distancepublic Node getNodeForItem(java.lang.String item)
item
- the itempublic java.util.Map<java.lang.String,Node> getNodes()
public boolean isConnected(java.lang.String a, java.lang.String b)
a
- the ab
- the bpublic void pressedOn(java.lang.String itemID)
item
- public void releasedOn(java.lang.String itemID)
itemID
- the item idpublic boolean removeEdges(java.util.List<Edge> collection)
collection
- the collection