|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| DirectionTransformer | Functions 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. |
Mechanisms for graph transformation. These currently include:
DirectionTransformer: generates graphs where input undirected
edges have been converted to directed edges, or vice versa
FoldingTransformer: transforms k-partite graphs or hypergraphs
into unipartite graphs
VertexPartitionCollapser: 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.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||