Modifier and Type | Class and Description |
---|---|
class |
MaximumDegree<K,VV,EV>
Removes vertices from a graph with degree greater than the given maximum.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
MaximumDegree.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
Modifier and Type | Method and Description |
---|---|
protected boolean |
Simplify.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
Modifier and Type | Class and Description |
---|---|
class |
Simplify<K extends Comparable<K> & CopyableValue<K>,VV,EV>
Add symmetric edges and remove self-loops and duplicate edges from an
undirected graph.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
Simplify.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
Modifier and Type | Class and Description |
---|---|
class |
TranslateEdgeValues<K,VV,OLD,NEW>
Translate
Edge values using the given TranslateFunction . |
class |
TranslateGraphIds<OLD,NEW,VV,EV>
|
class |
TranslateVertexValues<K,OLD,NEW,EV>
Translate
Vertex values using the given TranslateFunction . |
Modifier and Type | Method and Description |
---|---|
protected boolean |
TranslateVertexValues.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
protected boolean |
TranslateGraphIds.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
protected boolean |
TranslateEdgeValues.mergeConfiguration(GraphAlgorithmWrappingGraph other) |
Modifier and Type | Method and Description |
---|---|
protected abstract boolean |
GraphAlgorithmWrappingGraph.mergeConfiguration(GraphAlgorithmWrappingGraph other)
An algorithm must first test whether the configurations can be merged
before merging individual fields.
|
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.