notio
Class NodeMapping

java.lang.Object
  |
  +--notio.NodeMapping

public class NodeMapping
extends java.lang.Object

A mapping between the nodes in two graphs. The primary purpose for this class is to provide the details of a match between two graphs. It consists of a list of pairs of the two types of nodes. Each pair is a mapping. Since there are some conditions that allow one-to-many mappings, there may be duplicates amongst the first or second elements of the pairs, but no two pairings will be identical. For example: { a->B, a->C, b->B } is possible but { a->B, a->B } is not.


Constructor Summary
NodeMapping(Graph newFirstGraph, Graph newSecondGraph, Concept[] newFirstConcepts, Concept[] newSecondConcepts, Relation[] newFirstRelations, Relation[] newSecondRelations, MatchResult[] newMatchResults)
          Constructs a node mapping between the two graphs.
 
Method Summary
 Concept[] getFirstConcepts()
          Returns an array that forms the first elements of the Concept pairs.
 Graph getFirstGraph()
          Returns the first graph involved in the mapping.
 Relation[] getFirstRelations()
          Returns an array that forms the first elements of the Relation pairs.
 MatchResult[] getMatchResults()
          Returns an array of match results that come from matching the graphs nested in concepts.
 Concept[] getSecondConcepts()
          Returns an array that forms the second elements of the Concept pairs.
 Graph getSecondGraph()
          Returns the second graph involved in the mapping.
 Relation[] getSecondRelations()
          Returns an array that forms the second elements of the Relation pairs.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

NodeMapping

public NodeMapping(Graph newFirstGraph,
                   Graph newSecondGraph,
                   Concept[] newFirstConcepts,
                   Concept[] newSecondConcepts,
                   Relation[] newFirstRelations,
                   Relation[] newSecondRelations,
                   MatchResult[] newMatchResults)
Constructs a node mapping between the two graphs.
Parameters:
newFirstGraph - the graph being mapped from.
newSecondGraph - the graph being mapped into.
newFirstConcepts - the array of concepts that form the first elements of the concept pairs.
newSecondConcepts - the array of concepts that form the second elements of the concept pairs.
newFirstRelations - the array of relations that form the first elements of the relation pairs.
newSecondRelations - the array of relations that form the second elements of the relation pairs.
newMatchResults - an array of match results from the matching of concepts with nested graphs corresponding to the order of the concept pairs.
Method Detail

getFirstGraph

public Graph getFirstGraph()
Returns the first graph involved in the mapping.
Returns:
the first graph involved in the mapping.

getSecondGraph

public Graph getSecondGraph()
Returns the second graph involved in the mapping.
Returns:
the second graph involved in the mapping.

getFirstConcepts

public Concept[] getFirstConcepts()
Returns an array that forms the first elements of the Concept pairs.
Returns:
an array of Concepts that map into the second array of Concepts.

getSecondConcepts

public Concept[] getSecondConcepts()
Returns an array that forms the second elements of the Concept pairs.
Returns:
an array of Concepts that map into the first array of Concepts.

getFirstRelations

public Relation[] getFirstRelations()
Returns an array that forms the first elements of the Relation pairs.
Returns:
an array of Relations that map into the second array of Relations.

getSecondRelations

public Relation[] getSecondRelations()
Returns an array that forms the second elements of the Relation pairs.
Returns:
an array of Relations that map into the first array of Relations.

getMatchResults

public MatchResult[] getMatchResults()
Returns an array of match results that come from matching the graphs nested in concepts. The order of the results corresponds to the order of the concept pairs returned by getFirstConcepts() and getSecondConcepts(). If the a concept did not have a nested graph, or if the matching scheme did not require that the graphs be matched, the corresponding match result will be null. If no match results wree specified when this mapping was constructed, this method will return null.
Returns:
an array of match results that correspond to the pairs of concepts.


Copyright 1998-1999 Finnegan Southey