|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.uci.ics.jung.algorithms.blockmodel.EquivalenceRelation
An EquivalenceRelation holds a number of Equivalent vertices from the same graph. created Feb 3, 2004
Constructor Summary | |
EquivalenceRelation(java.util.Set rv,
Graph g)
Input is the basic data structure underneath: a Set of Sets. |
Method Summary | |
java.util.Iterator |
getAllEquivalences()
Iterates through all the equivalence sets. |
java.util.Set |
getEquivalenceRelationContaining(Vertex v)
Returns the part of the relation that contains this vertex: it is, of course, a Set If the vertex does not belong to any relation, null is returned. |
Graph |
getGraph()
Returns the common graph to which all the vertices belong |
java.util.Set |
getSingletonVertices()
Returns the set of vertices that do not belong to an particular equivalence class. |
int |
numRelations()
Returns the number of relations defined. |
java.lang.String |
toString()
|
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
public EquivalenceRelation(java.util.Set rv, Graph g)
Method Detail |
public Graph getGraph()
public java.util.Set getSingletonVertices()
public java.util.Iterator getAllEquivalences()
public java.util.Set getEquivalenceRelationContaining(Vertex v)
public int numRelations()
public java.lang.String toString()
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |