TraversalGraph.EdgeSet overview
![]() | The class graph edge u -l->v corresponding to this edge set. |
![]() | |
![]() | An unmodifiable Set of IndexPair objects representing the endpoint indices of the intercopy copies in this set, i.e. the set of all (i,j) such that i != j and u^i -l->v^j is in the set. |
![]() | The set of target nodes of edges in this set. |
![]() | |
![]() | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
![]() | An unmodifiable list of source indices (Integer objects) corresponding to target index j. |
![]() | An unmodifiable list of target indices (Integer objects) corresponding to source index i. |
![]() | Gets the Type of the current instance. |
![]() | Is u^i -l->v^j in this set? |
![]() | Is "edgeSet" a set of copies of the same edge as this? |
![]() |
![]() |
![]() | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
![]() | Creates a shallow copy of the current Object. |
TraversalGraph.EdgeSet Class | edu.neu.ccs.demeter.APRlib Namespace