Package | Description |
---|---|
edu.uci.ics.jung.algorithms.blockmodel |
Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks.
|
Modifier and Type | Method and Description |
---|---|
protected EquivalenceRelation |
StructurallyEquivalent.createEquivalenceClasses(Graph g,
java.util.Set s)
Takes in a Set of Pairs (as in the resutls of checkEquivalent) and
massages into a Set of Sets, where each Set is an equivalence class.
|
EquivalenceRelation |
EquivalenceAlgorithm.getEquivalences(Graph g)
Runs the equivalence algorithm on the given graph,
and returns an equivalence relation.
|
EquivalenceRelation |
StructurallyEquivalent.getEquivalences(Graph g) |
Modifier and Type | Method and Description |
---|---|
protected void |
GraphCollapser.collapseVerticesIntoSuperVertices(EquivalenceRelation er,
java.util.Map superVertices,
org.apache.commons.collections.MultiMap vertices_to_edges)
Internal method for collapsing a set of vertexes.
|
Graph |
GraphCollapser.getCollapsedGraph(EquivalenceRelation equivalence)
This version collects sets of vertices in an equivalence relation into a single CollapsedVertex.
|
protected void |
GraphCollapser.replaceEquivalencesWithCollapsedVertices(EquivalenceRelation er,
Graph copy,
java.util.Map superVertices)
INTERNAL (undocumented) method.
|