cusack.hcg.games.pebble.algorithms.misc

Class SubgraphChecker

java.lang.Object

cusack.hcg.games.pebble.algorithms.misc.SubgraphChecker

public class SubgraphChecker
extends java.lang.Object

Runs contains on graphs and prints if a graph does not contain any subgraphs. The main method is specific to finding if lemke 9s contain lemke 8s, but other methods can be used more generally, though this is a werid class to have them in

Author:

mark.powers - 6/16/17

Field Summary

Fields

Modifier and Type	Field and Description
static DataSource	ds

Constructor Summary

Constructors

Constructor and Description
SubgraphChecker()

Method Summary

Modifier and Type	Method and Description
static java.util.ArrayList<Graph>	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>	getLemke8s() Gets all of the Lemke 8 graphs
static java.util.ArrayList<Graph>	getLemke9s() Gets all of the Lemke 9 graphs
static void	main(java.lang.String[] args)
static int[][]	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[][]	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

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

ds

public static DataSource ds

Constructor Detail

SubgraphChecker

public SubgraphChecker()

Method Detail

main

public static void main(java.lang.String[] args)

run

public static int[][] 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)).

runCUSTOM

public static int[][] 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

getLemke9s

public static java.util.ArrayList<Graph> getLemke9s()

Gets all of the Lemke 9 graphs

getLemke8s

public static java.util.ArrayList<Graph> getLemke8s()

Gets all of the Lemke 8 graphs

getGraphByIdRange

public static java.util.ArrayList<Graph> getGraphByIdRange(int inclusive,
                                                           int exclusive)

Gets all graphs with ids in range [inclusive, exclusive) !!!This method has not been tested