public Set<ProcessEdge> incomingEdgesOf( Process vertex ) { return graph.incomingEdgesOf( vertex ); }
protected Collection<ProcessFactory> getSinkDependenciesOn( Resource sourceResource ) { initResourceGraph(); Set<ProcessFactory> factories = new HashSet<ProcessFactory>(); Set<ProcessFactoryHolder> incoming = resourceGraph.incomingEdgesOf( sourceResource ); for( ProcessFactoryHolder processFactoryHolder : incoming ) factories.add( processFactoryHolder.processFactory ); return factories; }
/** * */ @Override public Set<Equivalences<T>> getDirectSub(Equivalences<T> v) { Set<Equivalences<T>> result = new LinkedHashSet<>(); for (DefaultEdge edge : dag.incomingEdgesOf(v)) { Equivalences<T> source = dag.getEdgeSource(edge); result.add(source); } return Collections.unmodifiableSet(result); }
/** * */ @Override public Set<Equivalences<T>> getDirectSub(Equivalences<T> v) { Set<Equivalences<T>> result = new LinkedHashSet<>(); for (DefaultEdge edge : dag.incomingEdgesOf(v)) { Equivalences<T> source = dag.getEdgeSource(edge); result.add(source); } return Collections.unmodifiableSet(result); }
public Path getIncomingEdge( ElementGraph parent ) { return Util.getFirst( graph.incomingEdgesOf( new Delegate( parent ) ) ); } }
try edges = graph.incomingEdgesOf( vertex );
@Override public Path createEdge( Delegate sourceVertex, Delegate targetVertex ) { Set<Path> paths = tree.graph.incomingEdgesOf( sourceVertex ); if( paths.size() > 1 ) throw new IllegalStateException( "too many incoming edges" ); Path path = Util.getFirst( paths ); return new Path( path, tree.graph.outDegreeOf( sourceVertex ) ); } }
try edges = graph.incomingEdgesOf( v );
final Set< DefaultEdge > incomingEdges = branchGraph.incomingEdgesOf( branch ); final Set< List< Spot >> predecessors = new HashSet<>( incomingEdges.size() ); for ( final DefaultEdge edge : incomingEdges )
final Set< DefaultEdge > incomingEdges = branchGraph.incomingEdgesOf( branch ); final Set< List< Spot >> predecessors = new HashSet<>( incomingEdges.size() ); for ( final DefaultEdge edge : incomingEdges )
private void checkChildrenSets(Set<String> oidsToCheck) { try (Session session = openSession()) { SimpleDirectedGraph<String, DefaultEdge> tc = (SimpleDirectedGraph) orgGraph.clone(); TransitiveClosure.INSTANCE.closeSimpleDirectedGraph(tc); for (String subroot : oidsToCheck) { LOGGER.info("Checking descendants of {}", subroot); Set<String> expectedChildren = new HashSet<>(); for (DefaultEdge edge : tc.incomingEdgesOf(subroot)) { expectedChildren.add(tc.getEdgeSource(edge)); } expectedChildren.add(subroot); LOGGER.trace("Expected children: {}", expectedChildren); Set<String> actualChildren = getActualChildrenOf(subroot, session); LOGGER.trace("Actual children: {}", actualChildren); Set<String> expectedMinusActual = new HashSet<>(expectedChildren); expectedMinusActual.removeAll(actualChildren); if (!expectedMinusActual.isEmpty()) { System.out.println("Expected-Actual = " + expectedMinusActual); } Set<String> actualMinusExpected = new HashSet<>(actualChildren); actualMinusExpected.removeAll(expectedChildren); if (!actualMinusExpected.isEmpty()) { System.out.println("Actual-Expected = " + actualMinusExpected); } assertEquals("Incorrect children for " + subroot, expectedChildren, actualChildren); } } }
/** * Constructor for the NamedDAG * @param dag the DAG from which we want to keep only the named descriptions */ public static <T> SimpleDirectedGraph <T,DefaultEdge> getNamedDAG(EquivalencesDAG<T> dag) { SimpleDirectedGraph<T,DefaultEdge> namedDAG = new SimpleDirectedGraph<>(DefaultEdge.class); for (Equivalences<T> v : dag) namedDAG.addVertex(v.getRepresentative()); for (Equivalences<T> s : dag) for (Equivalences<T> t : dag.getDirectSuper(s)) namedDAG.addEdge(s.getRepresentative(), t.getRepresentative()); for (Equivalences<T> v : dag) if (!v.isIndexed()) { // eliminate node for (DefaultEdge incEdge : namedDAG.incomingEdgesOf(v.getRepresentative())) { T source = namedDAG.getEdgeSource(incEdge); for (DefaultEdge outEdge : namedDAG.outgoingEdgesOf(v.getRepresentative())) { T target = namedDAG.getEdgeTarget(outEdge); namedDAG.addEdge(source, target); } } namedDAG.removeVertex(v.getRepresentative()); // removes all adjacent edges as well } return namedDAG; }