Package edu.uci.ics.jung.algorithms.transformation
package edu.uci.ics.jung.algorithms.transformation
Mechanisms for graph transformation. These currently include:
DirectionTransformer
: generates graphs where input undirected edges have been converted to directed edges, or vice versaFoldingTransformer
: transforms k-partite graphs or hypergraphs into unipartite graphsVertexPartitionCollapser
: transforms a graph, given a partition of its vertices into disjoint sets, into a graph in which each of these disjoint sets has been 'collapsed' into a single new vertex.
-
ClassesClassDescriptionFunctions for transforming graphs into directed or undirected graphs.FoldingTransformer<V,
E> Methods for creating a "folded" graph based on a k-partite graph or a hypergraph.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.