Uses of Package
edu.iu.pcl.absurdist.absurdist

Packages that use edu.iu.pcl.absurdist.absurdist
edu.iu.pcl.absurdist.absurdist The main graph matching algorithm.  
edu.iu.pcl.absurdist.bnb   
edu.iu.pcl.absurdist.common Data representation classes used in both absurdist and penalty packages.  
edu.iu.pcl.absurdist.gui Graphical user interface for displaying the graph matching process, and the best match found.  
edu.iu.pcl.absurdist.penalty This package implements a graph matching method based on the minimization of a certain "penalty functional".  
 

Classes in edu.iu.pcl.absurdist.absurdist used by edu.iu.pcl.absurdist.absurdist
Absurdist
          Class Absurdist provides the ABSURDIST II graph matching algorithms to compute the correspondence between two concept systems, and finds the optimal mappings between them.
Absurdist.Results
          Used for reporting.
Concept
          Class Concept specifies the data structure for a concept, which contains its name and some features.
ConceptSystem
          Class ConceptSystem is the data model for a concept system specifying the semantic network between the concepts.
Link
          Node pair (i,j).
Relation
          Class Relation Specifies the data structure for a relation, which contains its involved concepts and some features.
RelationModel
          Class RelationModel is the model for a particular type of relation, including specifications on its inherent properties.
 

Classes in edu.iu.pcl.absurdist.absurdist used by edu.iu.pcl.absurdist.bnb
Absurdist
          Class Absurdist provides the ABSURDIST II graph matching algorithms to compute the correspondence between two concept systems, and finds the optimal mappings between them.
 

Classes in edu.iu.pcl.absurdist.absurdist used by edu.iu.pcl.absurdist.common
ConceptSystem
          Class ConceptSystem is the data model for a concept system specifying the semantic network between the concepts.
 

Classes in edu.iu.pcl.absurdist.absurdist used by edu.iu.pcl.absurdist.gui
Absurdist
          Class Absurdist provides the ABSURDIST II graph matching algorithms to compute the correspondence between two concept systems, and finds the optimal mappings between them.
Concept
          Class Concept specifies the data structure for a concept, which contains its name and some features.
ConceptSystem
          Class ConceptSystem is the data model for a concept system specifying the semantic network between the concepts.
Relation
          Class Relation Specifies the data structure for a relation, which contains its involved concepts and some features.
RelationModel
          Class RelationModel is the model for a particular type of relation, including specifications on its inherent properties.
 

Classes in edu.iu.pcl.absurdist.absurdist used by edu.iu.pcl.absurdist.penalty
ConceptSystem
          Class ConceptSystem is the data model for a concept system specifying the semantic network between the concepts.