Package | Description |
---|---|
cusack.hcg.events | |
cusack.hcg.events.graph | |
cusack.hcg.games.multidesigns | |
cusack.hcg.games.powergraph.powerzones | |
cusack.hcg.games.weighted | |
cusack.hcg.games.weighted.events | |
cusack.hcg.graph |
Contains classes that are directly related to storing graph data.
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
MultiEdgeEvent.getEdges() |
Modifier and Type | Method and Description |
---|---|
void |
MultiEdgeEvent.setEdge(Edge e) |
Modifier and Type | Method and Description |
---|---|
static java.lang.String |
MultiEdgeEvent.edgesToString(java.util.ArrayList<Edge> eds) |
Constructor and Description |
---|
MultiEdgeEvent(S game,
Edge edge) |
MultiEdgeGraphEditEvent(PuzzleInstance game,
Edge e) |
Constructor and Description |
---|
MultiEdgeEvent(S game,
java.util.ArrayList<Edge> edges) |
MultiEdgeGraphEditEvent(PuzzleInstance game,
java.util.ArrayList<Edge> v) |
Constructor and Description |
---|
EdgeAddedEvent(PuzzleInstance game,
Edge e) |
EdgeRemovedEvent(PuzzleInstance game,
Edge e) |
Constructor and Description |
---|
MultiEdgesAddedEvent(PuzzleInstance game,
java.util.ArrayList<Edge> edges) |
MultiEdgesRemovedEvent(PuzzleInstance game,
java.util.ArrayList<Edge> edges) |
SubgraphAddedEvent(PuzzleInstance game,
java.util.ArrayList<Vertex> v,
java.util.ArrayList<Edge> e) |
SubgraphRemovedEvent(PuzzleInstance game,
java.util.ArrayList<Vertex> v,
java.util.ArrayList<Edge> e) |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
MultiDesignsInstance.getUncoveredEdges() |
Modifier and Type | Method and Description |
---|---|
java.util.Set<Edge> |
PowerZonesInstance.getConflictedEdges() |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
EdgeChooseInstance.chooseEdges(java.util.List<Edge> edges)
Adds each edge in the passed in list to the set of tree edges if the edge is in this object's graph
|
java.util.ArrayList<Edge> |
EdgeChooseInstance.unchooseEdges(java.util.List<Edge> edges)
Checks if each edge in the passed in list is a tree edge and removes it if so
|
Modifier and Type | Method and Description |
---|---|
boolean |
EdgeChooseInstance.chooseEdge(Edge e)
Passes e into the addTreeEdges method
|
int |
WeightedInstance.getWeightForEdge(Edge e)
Given an edge, get its weight
|
boolean |
EdgeChooseInstance.isChosenEdge(Edge e)
Given an edge, checks if it is a tree edge
|
boolean |
EdgeChooseInstance.unchooseEdge(Edge e)
It then calls removeTreeEdges and passes in the edge passed into this method
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
EdgeChooseInstance.chooseEdges(java.util.List<Edge> edges)
Adds each edge in the passed in list to the set of tree edges if the edge is in this object's graph
|
void |
EdgeChooseInstance.setUnvisited(java.util.ArrayList<Edge> edges)
For use with the MinimumSpanningTreeController
Sets all of the edges, if they exist in the graph, to "unvisited"
|
void |
EdgeChooseInstance.setVisited(java.util.ArrayList<Edge> edges)
For use with the MinimumSpanningTreeController
Sets all of the edges, if they exist in the graph, to "visited"
|
void |
WeightedInstance.setWeightsForEdges(java.util.ArrayList<Edge> edges,
int weight) |
void |
WeightedInstance.setWeightsForEdges(java.util.ArrayList<Edge> edges,
int[] weights) |
java.util.ArrayList<Edge> |
EdgeChooseInstance.unchooseEdges(java.util.List<Edge> edges)
Checks if each edge in the passed in list is a tree edge and removes it if so
|
Constructor and Description |
---|
MultiEdgeChosenEvent(EdgeChooseInstance game,
java.util.ArrayList<Edge> edges) |
MultiEdgeUnchosenEvent(EdgeChooseInstance game,
java.util.ArrayList<Edge> edges) |
MultiEdgeWeightChangedEvent(WeightedInstance game,
java.util.ArrayList<Edge> edges,
int newWeight) |
MultiEdgeWeightChangedEvent(WeightedInstance game,
java.util.ArrayList<Edge> edges,
int[] newWeights) |
Modifier and Type | Method and Description |
---|---|
Edge |
GraphWithData.convertEdge(SimpleEdge simpleEdge) |
Edge |
Graph.convertEdge(SimpleEdge simpleEdge)
Convert the SimpleEdge to an Edge, whether or not it is actually in the graph.
|
static Edge |
Edge.createEdge(Vertex from,
Vertex to) |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
GraphWithData.addEdges(java.util.ArrayList<Edge> edges,
boolean fireEvent)
Adds a list of edges to the graph
|
java.util.ArrayList<Edge> |
Graph.addEdges(java.util.List<Edge> edges)
Adds edges to this graph from a given list
|
java.util.ArrayList<Edge> |
Graph.addVertexAndLink(Vertex toPaste,
java.util.ArrayList<Vertex> toLink) |
java.util.ArrayList<Edge> |
Graph.connectAll(java.util.ArrayList<Vertex> verts)
This method creates edges between all the vertices that are passed in
|
java.util.ArrayList<Edge> |
GraphWithData.convertEdges(java.util.ArrayList<SimpleEdge> simpleEdges) |
java.util.ArrayList<Edge> |
Graph.convertEdges(java.util.ArrayList<SimpleEdge> simpleEdges)
Return an ArrayList of Edges equivalent to the SimpleEdges passed in.
|
java.util.ArrayList<Edge> |
Graph.disconnectAll(java.util.ArrayList<Vertex> verts)
This method removes edges between all the vertices that are passed in
|
java.util.ArrayList<Edge> |
GraphWithData.getEdges() |
java.util.ArrayList<Edge> |
Graph.getEdges() |
java.util.ArrayList<Edge> |
Graph.getExistingEdges(java.util.ArrayList<Vertex> verts)
Create a list of edges that exist between the vertices that were passed in and makes those edges either directed
or undirected depending on the boolean flag's value
|
java.util.ArrayList<Edge> |
Graph.getMissingEdges()
Returns the edges that are not in the graph but the reverse edge is in the graph
|
java.util.ArrayList<Edge> |
Graph.getNonExistingEdges(java.util.ArrayList<Vertex> verts)
Given a list of vertices, finds all vertex pairs that do not have an edge between them
|
java.util.ArrayList<Edge> |
Graph.pasteSubgraph(java.util.ArrayList<Vertex> verts,
int translateX,
int translateY)
This method adds the list of vertices that are passed in to the graph and creates the necessary edges between
them.
|
java.util.ArrayList<Edge> |
Graph.pasteSubgraphAndLink(java.util.ArrayList<Vertex> toPaste,
java.util.ArrayList<Vertex> toLink,
int translateX,
int translateY) |
java.util.ArrayList<Edge> |
GraphWithData.removeEdges(java.util.ArrayList<Edge> edges,
boolean fireEvent)
Removes a list of edges from the graph
|
java.util.ArrayList<Edge> |
Graph.removeEdges(java.util.List<Edge> edges)
Removes edges contained in the given list from this graph
|
java.util.ArrayList<Edge> |
GraphWithData.removeSubgraph(java.util.ArrayList<Vertex> verts) |
java.util.ArrayList<Edge> |
Graph.removeSubgraph(java.util.List<Vertex> verts)
Remove all of these vertices and the associated edges between them and to other vertices that are still in the
graph.
|
java.util.ArrayList<Edge> |
GraphWithData.removeVertex(Vertex x,
boolean fireEvent)
Removes the specified Vertex from this graph
|
Modifier and Type | Method and Description |
---|---|
EdgeData |
GraphWithData.getEdgeData(Edge e) |
void |
GraphWithData.setEdgeData(Edge e,
EdgeData ed) |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
GraphWithData.addEdges(java.util.ArrayList<Edge> edges,
boolean fireEvent)
Adds a list of edges to the graph
|
java.util.ArrayList<Edge> |
Graph.addEdges(java.util.List<Edge> edges)
Adds edges to this graph from a given list
|
java.util.ArrayList<Edge> |
GraphWithData.removeEdges(java.util.ArrayList<Edge> edges,
boolean fireEvent)
Removes a list of edges from the graph
|
java.util.ArrayList<Edge> |
Graph.removeEdges(java.util.List<Edge> edges)
Removes edges contained in the given list from this graph
|