slib.sml.sm.core.utils
Class LCAFinderImpl

java.lang.Object
  extended by slib.sml.sm.core.utils.LCAFinderImpl
All Implemented Interfaces:
LCAFinder

public class LCAFinderImpl
extends Object
implements LCAFinder

Dummy implementation of the LCAFinder interface (high algorithmic complexity).

Author:
Harispe Sébastien

Constructor Summary
LCAFinderImpl()
           
 
Method Summary
 Set<org.openrdf.model.URI> getLCAs(slib.sglib.model.graph.G graph, org.openrdf.model.URI a, org.openrdf.model.URI b)
          Compute the set of Disjoint Common Ancestors of a pair of concepts The processed graph do not require to be transitively reduced.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

LCAFinderImpl

public LCAFinderImpl()
Method Detail

getLCAs

public Set<org.openrdf.model.URI> getLCAs(slib.sglib.model.graph.G graph,
                                          org.openrdf.model.URI a,
                                          org.openrdf.model.URI b)
                                   throws slib.utils.ex.SLIB_Exception
Description copied from interface: LCAFinder
Compute the set of Disjoint Common Ancestors of a pair of concepts The processed graph do not require to be transitively reduced.

Specified by:
getLCAs in interface LCAFinder
Parameters:
graph - the graph in which the search requires to be performed An exception is thrown if the queried vertices are not expressed in the graph
a - the first query vertex
b - the second query vertex
Returns:
the set of vertices corresponding to the DCA of vertices a and b. An empty set is returned if no DCA are found (Which can theoretically never happen).
Throws:
slib.utils.ex.SLIB_Exception


Copyright © 2013. All Rights Reserved.