/** * Compute the set of exclusive descendants of a class. Exclusive process: * the focused vertex will NOT be included in the set of descendants. * * @param v the vertex of interest * @return the exclusive set of descendants of the concept (empty set if * any). */ public Set<URI> getDescendantsExc(URI v) { return getRV(v); }
/** * @param graph */ public InstanceAccessor_RDF_TYPE(G graph) { this.graph = graph; this.descendantsEngine = new DescendantEngine(graph); }
/** * Compute the set of exclusive ancestors of all vertices contained in the * graph. Exclusive process: the focused vertex will NOT be included in the * set of ancestors. * * @return a map containing the exclusive set of ancestors of each vertex * concept (empty set if any). * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllAncestorsExc() throws SLIB_Ex_Critic { return getAllRV(); }
/** * Compute the set of exclusive descendants of all vertices contained in the * graph. Exclusive process: the focused vertex will NOT be included in the * set of ancestors. * * @return a map containing the exclusive set of descendants of each vertex * concept (empty set if any). * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllDescendantsExc() throws SLIB_Ex_Critic { return getAllRV(); }
/** * Compute the set of exclusive ancestors of a class. Exclusive process: the * focused vertex will NOT be included in the set of ancestors. * * @param v the vertex of interest * @return the exclusive set of ancestors of the concept (empty set if any). */ public Set<URI> getAncestorsExc(URI v) { return getRV(v); }
/** * Compute the inclusive descendants for all classes. * * @throws SLIB_Ex_Critic */ private synchronized void computeAllclassesDescendants() throws SLIB_Ex_Critic { cache.descendantsInc = bottomNodeAccessor.getAllRVInc(); }
/** * Compute the set of vertices corresponding to classes which can be reach from the given vertex. * Exclusive process: the focused vertex will NOT be included in the set of * reachable vertices. * @param v the vertex of interest * @return the set of classes which can be reached from the selected vertex */ public Set<URI> getRVClass(URI v) { return getRV(v); }
/** * Compute for all vertices of the loaded graph, the set of vertices corresponding to classes which can be reach from them. * Exclusive process: a vertex will NOT be included in the set of reachable vertices it can reach. * @return the map storing, for each vertex, the set of reachable vertices respecting the above constraint. * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllRVClass() throws SLIB_Ex_Critic { return getAllRV(); } }
/** * Compute the inclusive descendants for all classes. * * @throws SLIB_Ex_Critic */ private void computeAllclassesDescendants() throws SLIB_Ex_Critic { cache.descendantsInc = descGetter.getAllDescendantsInc(); }
/** * Compute the set of inclusive ancestors of all vertices contained in the * graph. The focused vertex will be included in the set of ancestors. * * @return a map containing the inclusive set of ancestors of each vertex * concept. * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllAncestorsInc() throws SLIB_Ex_Critic { return getAllRVInc(); } }
/** * Compute the inclusive ancestors for all classes. * * @throws SLIB_Ex_Critic */ private void computeAllclassesAncestors() throws SLIB_Ex_Critic { cache.ancestorsInc = ancGetter.getAllAncestorsInc(); }
/** * Compute the set of inclusive descendants of all vertices contained in the * graph. Exclusive process: the focused vertex will be included in the * set of ancestors. * * @return a map containing the inclusive set of descendants of each vertex * concept. * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllDescendantsInc() throws SLIB_Ex_Critic { return getAllRVInc(); } }
/** * Compute the set of exclusive descendants of a class. Exclusive process: * the focused vertex will NOT be included in the set of descendants. * * @param v the vertex of interest * @return the exclusive set of descendants of the concept (empty set if * any). */ public Set<URI> getDescendantsExc(URI v) { return getRV(v); }
/** * @param graph */ public InstanceAccessor_RDF_TYPE(G graph) { this.graph = graph; this.descendantsEngine = new DescendantEngine(graph); }
/** * Compute the set of exclusive ancestors of all vertices contained in the * graph. Exclusive process: the focused vertex will NOT be included in the * set of ancestors. * * @return a map containing the exclusive set of ancestors of each vertex * concept (empty set if any). * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllAncestorsExc() throws SLIB_Ex_Critic { return getAllRV(); }
/** * Compute the set of exclusive descendants of all vertices contained in the * graph. Exclusive process: the focused vertex will NOT be included in the * set of ancestors. * * @return a map containing the exclusive set of descendants of each vertex * concept (empty set if any). * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllDescendantsExc() throws SLIB_Ex_Critic { return getAllRV(); }
/** * Compute the set of exclusive ancestors of a class. Exclusive process: the * focused vertex will NOT be included in the set of ancestors. * * @param v the vertex of interest * @return the exclusive set of ancestors of the concept (empty set if any). */ public Set<URI> getAncestorsExc(URI v) { return getRV(v); }
/** * Compute the inclusive ancestors for all classes. * * @throws SLIB_Ex_Critic */ private synchronized void computeAllclassesAncestors() throws SLIB_Ex_Critic { cache.ancestorsInc = topNodeAccessor.getAllRVInc(); }
/** * Compute the set of vertices corresponding to classes which can be reach from the given vertex. * Exclusive process: the focused vertex will NOT be included in the set of * reachable vertices. * @param v the vertex of interest * @return the set of classes which can be reached from the selected vertex */ public Set<URI> getRVClass(URI v) { return getRV(v); }
/** * Compute for all vertices of the loaded graph, the set of vertices corresponding to classes which can be reach from them. * Exclusive process: a vertex will NOT be included in the set of reachable vertices it can reach. * @return the map storing, for each vertex, the set of reachable vertices respecting the above constraint. * @throws SLIB_Ex_Critic */ public Map<URI, Set<URI>> getAllRVClass() throws SLIB_Ex_Critic { return getAllRV(); } }