Class VertexPartitionCollapser<V,E,CV,CE>
java.lang.Object
edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser<V,E,CV,CE>
This class transforms a graph with a known vertex partitioning into a graph whose
vertices correspond to the input graph's partitions. Two vertices in the output graph
are connected if and only if there exists at least one edge between vertices in the
corresponding partitions of the input graph. If the output graph permits parallel edges,
there will be an edge connecting two vertices in the new graph for each such
edge connecting constituent vertices in the input graph.
Concept based on Danyel Fisher's GraphCollapser
in JUNG 1.x.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptioncollapseVertexPartitions
(VertexPartition<V, E> partitioning) Creates a new graph whose vertices correspond to the partitions of the supplied graph.
-
Field Details
-
graph_factory
-
vertex_factory
-
edge_factory
-
set_collapsedv
-
-
Constructor Details
-
VertexPartitionCollapser
public VertexPartitionCollapser(com.google.common.base.Supplier<Graph<CV, CE>> graph_factory, com.google.common.base.Supplier<CV> vertex_factory, com.google.common.base.Supplier<CE> edge_factory) Creates an instance with the specified graph and element factories.- Parameters:
graph_factory
- used to construct the new graphvertex_factory
- used to construct the vertices of the new graphedge_factory
- used to construct the edges of the new graph
-
-
Method Details
-
collapseVertexPartitions
Creates a new graph whose vertices correspond to the partitions of the supplied graph.- Parameters:
partitioning
- a vertex partition of a graph- Returns:
- a new graph whose vertices correspond to the partitions of the supplied graph
-
getSetToCollapsedVertexTransformer
- Returns:
- a Function from vertex sets in the original graph to collapsed vertices in the transformed graph.
-