/** * @param graph */ public InstanceAccessor_RDF_TYPE(G graph) { this.graph = graph; this.descendantsEngine = new DescendantEngine(graph); }
/** * @param graph */ public InstanceAccessor_RDF_TYPE(G graph) { this.graph = graph; this.descendantsEngine = new DescendantEngine(graph); }
descGetter = new DescendantEngine(graph);
/** * Constructor of an engine associated to the given graph. The taxonomic * relationship used is rdfs:subClassOf * * Note that the engine expects the graph not to be modified and coherency * of results are only ensured in this case. Please refer to the general * documentation of the class for more information considering this specific * restriction. * * The engine creation is expensive, avoid useless calls to the constructor. * Indeed, some information such as classes and instances of the graph are * computed at engine creation which can lead to performance issues dealing * with large graphs. * * @param g the graph associated to the engine. * @throws SLIB_Ex_Critic */ public SM_Engine(final G g) throws SLIB_Ex_Critic { this.graph = g; topNodeAccessor = new AncestorEngine(graph); bottomNodeAccessor = new DescendantEngine(graph); logger.info("Computing classes..."); classes = GraphAccessor.getClasses(graph); instanceAccessor = new InstanceAccessorTax(graph); initEngine(); }
DescendantEngine descEngine = new DescendantEngine(g); Set<URI> descsInclusive = descEngine.getDescendantsInc(rootURI);
DescendantEngine descEngine = new DescendantEngine(g); Set<URI> descsInclusive = descEngine.getDescendantsInc(rootURI);
DescendantEngine descEngine = new DescendantEngine(g); Set<URI> descsInclusive = descEngine.getDescendantsInc(rootURI);
DescendantEngine descEngine = new DescendantEngine(g); Set<URI> descsInclusive = descEngine.getDescendantsInc(rootURI);