Package | Description |
---|---|
org.jgrapht.alg.cycle |
Algorithms related to graph cycles.
|
org.jgrapht.graph |
Implementations of various graphs.
|
Modifier and Type | Method and Description |
---|---|
protected GraphWalk<V,E> |
HierholzerEulerianCycle.buildWalk()
Build final walk
|
GraphWalk<V,E> |
AhujaOrlinSharmaCyclicExchangeLocalAugmentation.getLocalAugmentationCycle()
Calculates a valid subset-disjoint negative cycle.
|
Modifier and Type | Method and Description |
---|---|
GraphWalk<V,E> |
GraphWalk.concat(GraphWalk<V,E> extension,
Function<GraphWalk<V,E>,Double> walkWeightCalculator)
Concatenates the specified GraphWalk to the end of this GraphWalk.
|
static <V,E> GraphWalk<V,E> |
GraphWalk.emptyWalk(Graph<V,E> graph)
Convenience method which creates an empty walk.
|
GraphWalk<V,E> |
GraphWalk.reverse()
Reverses the direction of the walk.
|
GraphWalk<V,E> |
GraphWalk.reverse(Function<GraphWalk<V,E>,Double> walkWeightCalculator)
Reverses the direction of the walk.
|
static <V,E> GraphWalk<V,E> |
GraphWalk.singletonWalk(Graph<V,E> graph,
V v)
Convenience method which creates a walk consisting of a single vertex with weight 0.0.
|
static <V,E> GraphWalk<V,E> |
GraphWalk.singletonWalk(Graph<V,E> graph,
V v,
double weight)
Convenience method which creates a walk consisting of a single vertex.
|
Modifier and Type | Method and Description |
---|---|
GraphWalk<V,E> |
GraphWalk.concat(GraphWalk<V,E> extension,
Function<GraphWalk<V,E>,Double> walkWeightCalculator)
Concatenates the specified GraphWalk to the end of this GraphWalk.
|
Modifier and Type | Method and Description |
---|---|
GraphWalk<V,E> |
GraphWalk.concat(GraphWalk<V,E> extension,
Function<GraphWalk<V,E>,Double> walkWeightCalculator)
Concatenates the specified GraphWalk to the end of this GraphWalk.
|
GraphWalk<V,E> |
GraphWalk.reverse(Function<GraphWalk<V,E>,Double> walkWeightCalculator)
Reverses the direction of the walk.
|
Copyright © 2019. All rights reserved.