|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AdjacencyMatrixGraph | |
---|---|
algorithms | |
graph | |
importer |
Uses of AdjacencyMatrixGraph in algorithms |
---|
Methods in algorithms with parameters of type AdjacencyMatrixGraph | |
---|---|
static Solver |
Solver.solverFactory(ListColoredAdjacencyMatrixGraph g,
AdjacencyMatrixGraph h,
Solver.MatchingType m,
Results.Instance instance,
Solver.AlgorithmType algoType)
|
Constructors in algorithms with parameters of type AdjacencyMatrixGraph | |
---|---|
IterativeSolver(ListColoredAdjacencyMatrixGraph g,
AdjacencyMatrixGraph h,
Solver.MatchingType m,
Results.Instance instance)
|
|
MaxIterativeSolver(ListColoredAdjacencyMatrixGraph g,
AdjacencyMatrixGraph h,
Solver.MatchingType m,
Results.Instance instance)
|
|
SearchTreeSolver(ListColoredAdjacencyMatrixGraph g,
AdjacencyMatrixGraph h,
Solver.MatchingType m,
Results.Instance instance)
|
|
Solver(ListColoredAdjacencyMatrixGraph g,
AdjacencyMatrixGraph h)
Generates an instance of the Bounded-list Morphism Problem from two input graphs. |
Uses of AdjacencyMatrixGraph in graph |
---|
Subclasses of AdjacencyMatrixGraph in graph | |
---|---|
class |
ListColoredAdjacencyMatrixGraph
|
Methods in graph that return AdjacencyMatrixGraph | |
---|---|
AdjacencyMatrixGraph |
AdjacencyMatrixGraph.copyGraph()
|
AdjacencyMatrixGraph |
AdjacencyMatrixGraph.copyGraph(int addVerts)
|
AdjacencyMatrixGraph |
AdjacencyMatrixGraph.inducedGraphVertexDel(java.util.Set<java.lang.Integer> del)
|
Uses of AdjacencyMatrixGraph in importer |
---|
Methods in importer with parameters of type AdjacencyMatrixGraph | |
---|---|
ColorList |
ParseGraph.parseColors(java.util.HashMap<java.lang.String,java.util.List<java.lang.String>> matches,
AdjacencyMatrixGraph g,
AdjacencyMatrixGraph h)
|
ColorList |
ParseGraph.parseColors(java.lang.String fileName,
AdjacencyMatrixGraph g,
AdjacencyMatrixGraph h)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |