Uses of Class
edu.iu.pcl.absurdist.graph.Graph

Packages that use Graph

edu.iu.pcl.absurdist.absurdist	The main graph matching algorithm.
edu.iu.pcl.absurdist.graph	Code for generating asymmetric graphs (graphs without non-trivial homomorphisms).

Uses of Graph in edu.iu.pcl.absurdist.absurdist

Constructors in edu.iu.pcl.absurdist.absurdist with parameters of type Graph

ConceptSystem(Graph graph)
Creates a concept system from a graph instance.

Uses of Graph in edu.iu.pcl.absurdist.graph

Methods in edu.iu.pcl.absurdist.graph that return Graph

Graph	Graph.permute(int[] p) Permutes the graph.
static Graph	GenGraphs.genAsymGraph(int N, double D) Tries to generate a random asymmetric graphs.