Class FlowAlgorithm.FlowImpl<E>

java.lang.Object

org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl<E>

Type Parameters:

E - graph edge type

All Implemented Interfaces:

FlowAlgorithm.Flow<E>

Direct Known Subclasses:

MaximumFlowAlgorithm.MaximumFlowImpl, MinimumCostFlowAlgorithm.MinimumCostFlowImpl

Enclosing interface:

FlowAlgorithm<V,E>

public static class FlowAlgorithm.FlowImpl<E>
extends Object
implements FlowAlgorithm.Flow<E>

Default implementation of FlowAlgorithm.Flow

Field Summary

Fields

Modifier and Type	Field	Description
private Map<E,Double>	flowMap	A mapping defining the flow on the network

Constructor Summary

Constructors

Constructor	Description
FlowImpl(Map<E,Double> flowMap)	Constructs a new flow

Method Summary

Modifier and Type	Method	Description
Map<E,Double>	getFlowMap()	Returns a mapping from the network flow edges to the corresponding flow values.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface FlowAlgorithm.Flow

getFlow

Field Details

flowMap

private Map<E,Double> flowMap

A mapping defining the flow on the network

Constructor Details

FlowImpl

public FlowImpl(Map<E,Double> flowMap)

Constructs a new flow

Parameters:

flowMap - the mapping defining the flow on the network

Method Details

getFlowMap

public Map<E,Double> getFlowMap()

Returns a mapping from the network flow edges to the corresponding flow values. The mapping contains all edges of the flow network regardless of whether there is a non-zero flow on an edge or not.

Specified by:

getFlowMap in interface FlowAlgorithm.Flow<E>

Returns:

a read-only map that defines a feasible flow.