@Override public void edgeTraversed( final EdgeTraversalEvent< Spot, DefaultWeightedEdge > event ) { final DefaultWeightedEdge e = event.getEdge(); currentConnectedEdgeSet.add( e ); edgeToID.put( e, ID ); }
protected EdgeTraversalEvent< V, E > createEdgeTraversalEvent( final E edge ) { if ( isReuseEvents() ) { reusableEdgeEvent.setEdge( edge ); return reusableEdgeEvent; } return new EdgeTraversalEvent< >( this, edge ); }
protected EdgeTraversalEvent< V, E > createEdgeTraversalEvent( final E edge ) { if ( isReuseEvents() ) { reusableEdgeEvent.setEdge( edge ); return reusableEdgeEvent; } return new EdgeTraversalEvent< >( this, edge ); }
/** * Create an edge traversal event. * * @param edge the edge * @return the event */ protected EdgeTraversalEvent<E> createEdgeTraversalEvent(E edge) { if (isReuseEvents()) { reusableEdgeEvent.setEdge(edge); return reusableEdgeEvent; } else { return new EdgeTraversalEvent<>(this, edge); } }
@Override public void edgeTraversed( final EdgeTraversalEvent< Spot, DefaultWeightedEdge > event ) { final DefaultWeightedEdge e = event.getEdge(); currentConnectedEdgeSet.add( e ); edgeToID.put( e, ID ); }
@Override public void edgeTraversed(final EdgeTraversalEvent<DefaultEdge> e) { final IServiceDAGVertex<?> dagSource = traversedGraph.getEdgeSource(e.getEdge()); final IServiceDAGVertex<?> dagTarget = traversedGraph.getEdgeTarget(e.getEdge()); final Collection<IServiceTreeVertex<?>> treeParents = findVisitedDAGVertices(dagSource); treeParents.forEach(treeParent -> addTreeVertex(treeParent, dagTarget)); }