cusack.hcg.games.multidesigns.algorithms

Class PossibleSubGraphVertexSubsets

java.lang.Object

cusack.hcg.games.multidesigns.algorithms.PossibleSubGraphVertexSubsets

public class PossibleSubGraphVertexSubsets
extends java.lang.Object

Determime which subsets of vertices might be O.K. to map a subgraph to, based only on degrees of the vertices. This can be improved (See comments below) by taking into account more information about the sequence than it currently is. I have an idea, but it might be a little tricky to implement.

Author:

cusack

Constructor Summary

Constructors

Constructor and Description
PossibleSubGraphVertexSubsets(SubGraph subgraph, SimpleGraph graph, int tolerance)

Method Summary

Modifier and Type	Method and Description
java.util.ArrayList<int[]>	getPossibleVertexSubsets()
void	init(int tolerance)

Methods inherited from class java.lang.Object

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

Constructor Detail

PossibleSubGraphVertexSubsets

public PossibleSubGraphVertexSubsets(SubGraph subgraph,
                                     SimpleGraph graph,
                                     int tolerance)

Method Detail

init

public void init(int tolerance)

getPossibleVertexSubsets

public java.util.ArrayList<int[]> getPossibleVertexSubsets()