|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
EquivalenceAlgorithm | Any blockmodel equivalence algorithm should implement this method; it allows users to access EquivalenceAlgorithms more easily. |
GraphCollapser.CollapsedEdge | The CollapsedEdge interface represents a set of edges in some other graph. |
GraphCollapser.CollapsedVertex | This interface represents a vertex that holds a set of objects in some other graph. |
Class Summary | |
---|---|
BipartiteGraphCollapser | A variant of the GraphCollapser that overrides two minor functions and defines CollapsedBipartiteEdge and CollapsedBipartiteVertex. |
EquivalenceRelation | An EquivalenceRelation holds a number of Equivalent vertices from the same graph. |
GraphCollapser | This is a skeleton class for collapsing graphs. |
GraphCollapser.CollapsedSparseVertex | A CollapsedSparseVertex extends CollapsedVertex. |
GraphCollapser.DirectedCollapsedEdge | This class represents a Collapsed Directed edge, and extends DirectedSparseEdge. |
GraphCollapser.UndirectedCollapsedEdge | This class represents a Collapsed Undirected edge, and extends UndirectedSparseEdge. |
StructurallyEquivalent | Checks a graph for sets of structurally equivalent vertices: vertices that share all the same edges. |
StructurallyEquivalentII | Checks a graph for sets of structurally equivalent vertices: vertices that share all the same edges. |
Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks.
The definition of "equivalence" used here is different from the equivalence functions defined between graphs. This equivalence refers to the network measure forms of equivalence used for blockmodeling. In blockmodeling, groups of vertices are clustered together by similarity (as if "blocked" together on the diagonal of a matrix). This implementation provides:EquivalenceAlgorithm
EquivalenceRelation
StructurallyEquivalent
GraphCollapser
GraphCollapser.CollapsedVertex
.
It also replaces all the edges from
each vertex to the graph with a GraphCollapser.CollapsedEdge
.
(See the class documentation to see
how this is done.)BipartiteGraphCollapser
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |