Uses of Class
cusack.hcg.graph.Graph

Packages that use Graph

Package	Description
cusack.hcg.comm
cusack.hcg.database
cusack.hcg.games.graph.graph
cusack.hcg.games.multidesigns.algorithms
cusack.hcg.games.pebble.algorithms.matrixconversion
cusack.hcg.games.pebble.algorithms.misc
cusack.hcg.graph	Contains classes that are directly related to storing graph data.
cusack.hcg.gui.dialogs
cusack.hcg.model

Uses of Graph in cusack.hcg.comm

Methods in cusack.hcg.comm that return Graph

Modifier and Type	Method and Description
Graph	DataSource.getGraph(int graphID)
Graph	DataSource.getGraph(java.lang.String name)
Graph	DataSource.getGraphForPuzzle(int gameID) This method is used for Replays since they do not store a graph_id.

Methods in cusack.hcg.comm with parameters of type Graph

Modifier and Type	Method and Description
int	DataSource.insertGraph(Graph graph)
boolean	DataSource.updateGraph(Graph graph)

Uses of Graph in cusack.hcg.database

Constructors in cusack.hcg.database with parameters of type Graph

Constructor and Description
Graph(Graph g)
GraphWithUsage(Graph g)

Uses of Graph in cusack.hcg.games.graph.graph

Constructors in cusack.hcg.games.graph.graph with parameters of type Graph

Constructor and Description
GraphInstance(Graph graph) This is a special case that needs a constructor that takes a graph.

Uses of Graph in cusack.hcg.games.multidesigns.algorithms

Constructors in cusack.hcg.games.multidesigns.algorithms with parameters of type Graph

Constructor and Description
MultiGraphAdjacencyMatrix(Graph graph)
SubGraph(Graph g)

Uses of Graph in cusack.hcg.games.pebble.algorithms.matrixconversion

Methods in cusack.hcg.games.pebble.algorithms.matrixconversion that return Graph

Modifier and Type	Method and Description
static Graph	UtilityMethodsForG6Graphs.G6toGraph(java.lang.String graph6) Adapted from JS at "http://treedecompositions.com/#/translate" The string parameter is a graph of the format specified here "https://users.cecs.anu.edu.au/~bdm/data/formats.html"
Graph	G6FileReader.next()

Methods in cusack.hcg.games.pebble.algorithms.matrixconversion that return types with arguments of type Graph

Modifier and Type	Method and Description
static java.util.List<Graph>	UtilityMethodsForG6Graphs.readListFileIntoGenericGraphs(java.lang.String pathToFile)

Uses of Graph in cusack.hcg.games.pebble.algorithms.misc

Methods in cusack.hcg.games.pebble.algorithms.misc that return types with arguments of type Graph

Modifier and Type	Method and Description
static java.util.ArrayList<Graph>	TreeFromSubgraphRelationGenerator.getGraphByIdRange(int inclusive, int exclusive) Gets all graphs with ids in range [inclusive, exclusive) !!!This method has not been tested
static java.util.ArrayList<Graph>	SubgraphChecker.getGraphByIdRange(int inclusive, int exclusive) Gets all graphs with ids in range [inclusive, exclusive) !!!This method has not been tested
static java.util.ArrayList<Graph>	TreeFromSubgraphRelationGenerator.getLemke8s() Gets all of the Lemke 8 graphs
static java.util.ArrayList<Graph>	SubgraphChecker2.getLemke8s() Gets all of the Lemke 8 graphs
static java.util.ArrayList<Graph>	SubgraphChecker.getLemke8s() Gets all of the Lemke 8 graphs
static java.util.ArrayList<Graph>	TreeFromSubgraphRelationGenerator.getLemke9s()
static java.util.ArrayList<Graph>	SubgraphChecker2.getLemke9s() Gets all of the Lemke 9 graphs
static java.util.ArrayList<Graph>	SubgraphChecker.getLemke9s() Gets all of the Lemke 9 graphs

Method parameters in cusack.hcg.games.pebble.algorithms.misc with type arguments of type Graph

Modifier and Type	Method and Description
static int[][]	SubgraphChecker2.run(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) Gets a matrix of relations, where an entry in the matrix at [x][y]==1 if list1.get(x).containsSubgraph(list2.get(y)).
static int[][]	SubgraphChecker2.run(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) Gets a matrix of relations, where an entry in the matrix at [x][y]==1 if list1.get(x).containsSubgraph(list2.get(y)).
static int[][]	SubgraphChecker.run(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) Gets a matrix of relations, where an entry in the matrix at [x][y]==1 if list1.get(x).containsSubgraph(list2.get(y)).
static int[][]	SubgraphChecker.run(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) Gets a matrix of relations, where an entry in the matrix at [x][y]==1 if list1.get(x).containsSubgraph(list2.get(y)).
static int[][]	SubgraphChecker.runCUSTOM(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) This algorithm is used to generated the relationship of 8/9s since we can't just use edge count
static int[][]	SubgraphChecker.runCUSTOM(java.util.ArrayList<Graph> list1, java.util.ArrayList<Graph> list2) This algorithm is used to generated the relationship of 8/9s since we can't just use edge count

Uses of Graph in cusack.hcg.graph

Methods in cusack.hcg.graph that return Graph

Modifier and Type	Method and Description
Graph	GraphWithData.copyOfOriginalGraph()
Graph	Graph.copyOfOriginalGraph() Makes a copy from the state of the graph when it was initialized (including from copy constructors) or when makeCurrentStateInitialState() was called
static Graph	GraphFactory.createCartesianProduct(java.awt.Point initialPoint, Graph A, Graph B)
static Graph	GraphFactory.createClique(java.awt.Point startingLocation, int numberNodes, int radius) Adds a clique to the graph and returns it.
static Graph	GraphFactory.createCompleteBipartite(java.awt.Point startingLocation, int numberNodes1, int numberNodes2) Adds a complete bipartite graph and returns it.
static Graph	GraphFactory.createCycle(java.awt.Point startingLocation, int numberNodes, int radius) Adds a cycle to the graph and returns it.
static Graph	GraphFactory.createPath(java.awt.Point startingLocation, int numberNodes, int orientation) Adds a path to the graph and returns it.
static Graph	GraphFactory.createStar(java.awt.Point startingLocation, int numberNodes, int radius) Adds a star to the graph and returns it.
static Graph	GraphFactory.createTensorProduct(java.awt.Point initialPoint, Graph A, Graph B)
static Graph	GraphFactory.createWheel(java.awt.Point startingLocation, int numberNodes, int radius) Adds a star to the graph and returns it.
Graph	GraphWithData.getGraph()
Graph	Vertex.getMyGraph() This method returns the graph that this vertex contains.
Graph	DrawableProblem.vanillaGraphFromString(java.lang.String s)

Methods in cusack.hcg.graph with parameters of type Graph

Modifier and Type	Method and Description
void	GraphWithData.addSubGraph(java.awt.Point p, Graph g) Adds a subgraph to this graph
void	Graph.addSubGraph(java.awt.Point offset, Graph subgraph) Add subgraph to this graph, offset by the given point.
boolean	Graph.containsInducedSubgraph(Graph other) Returns true if other other is a subgraph of this where other matches exactly within the subgraph of this.
boolean	Graph.containsSubgraph(Graph other) Returns true if other other is a subgraph of this
static Graph	GraphFactory.createCartesianProduct(java.awt.Point initialPoint, Graph A, Graph B)
static Graph	GraphFactory.createTensorProduct(java.awt.Point initialPoint, Graph A, Graph B)
int[]	Graph.getSubgraphPermutation(Graph other) Determine if the other graph is a subgraph of this graph.
void	Vertex.setMyGraph(Graph g) Sets the graph that this vertex belongs to to the passed in graph

Constructors in cusack.hcg.graph with parameters of type Graph

Constructor and Description
EfficientListGraph(Graph graph)
EfficientMatrixGraph(Graph graph)
Graph(Graph graph) Deep copy constructor
GraphWithData(Graph graph, VertexData defaultData) Create a GraphWithData object based on graph, assigning to each vertex a copy of default data.
Vertex(Graph g) Default constructor

Uses of Graph in cusack.hcg.gui.dialogs

Methods in cusack.hcg.gui.dialogs that return Graph

Modifier and Type	Method and Description
static Graph	UsefulDialogs.chooseGraphInstance(java.awt.Component gui, boolean useMultiEditor)

Uses of Graph in cusack.hcg.model

Methods in cusack.hcg.model with parameters of type Graph

Modifier and Type	Method and Description
void	PuzzleInstance.addGraph(java.awt.Point p, Graph g)
static PuzzleInstance	PuzzleInstanceFactory.createBlankPuzzleInstance(Graph graph, java.lang.String problemName)
void	PuzzleInstance.setGraph(Graph graph) This method sets the graph for this PuzzleInstance.