public void simplify() { collapseSCC(); removeRedundancies(); }
public ReachabilityGraph<AsOWLNamedIndividual> build() { _graph.simplify(); return _graph; } }
/** * Computes the strongly connected components of a graph. This implementation is based on Tarjan's algorithm */ public static <E> List<Set<EntityNode<E>>> computeSCC(final ReachabilityGraph<E> graph) { return new SCCComputer<E>().computeSCC(graph); }
public List<Set<EntityNode<E>>> computeSCC(final ReachabilityGraph<E> graph) { final Collection<EntityNode<E>> nodes = graph.getEntityNodes(); for (final Node node : nodes) { if (_nodeInfos.containsKey(node)) continue; computeSCC(node); } return _stronglyConnectedComponents; }
public boolean contains(final E entity) { return _graph.getNode(entity) != null; }
/** * {@inheritDoc} */ @Override public Iterator<T> iterator() { return new PairIterator(); }
public PairSet(final Set<T> first, final Set<T> second) { _firstSet = first; _secondSet = second; _size = computeUnionSize(); }
public <X> EntityNode<X> asEntityNode() { return _node.asEntityNode(); }
public boolean isEntityNode() { return _node.isEntityNode(); }
public void simplify() { collapseSCC(); removeRedundancies(); }
/** * Computes the strongly connected components of a graph. This implementation is based on Tarjan's algorithm */ public static <E> List<Set<EntityNode<E>>> computeSCC(final ReachabilityGraph<E> graph) { return new SCCComputer<E>().computeSCC(graph); }
public List<Set<EntityNode<E>>> computeSCC(final ReachabilityGraph<E> graph) { final Collection<EntityNode<E>> nodes = graph.getEntityNodes(); for (final Node node : nodes) { if (_nodeInfos.containsKey(node)) continue; computeSCC(node); } return _stronglyConnectedComponents; }
public ReachabilityGraph<AsOWLNamedIndividual> build() { _graph.simplify(); return _graph; } }
public boolean contains(final E entity) { return _graph.getNode(entity) != null; }
/** * {@inheritDoc} */ @Override public Iterator<T> iterator() { return new PairIterator(); }
public PairSet(final Set<T> first, final Set<T> second) { _firstSet = first; _secondSet = second; _size = computeUnionSize(); }
public <X> EntityNode<X> asEntityNode() { return _node.asEntityNode(); }