Module org.jgrapht.core
Package org.jgrapht.alg.interfaces

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 java.lang.Object
implements FlowAlgorithm.Flow<E>
Default implementation of FlowAlgorithm.Flow

  • Constructor Summary

    Constructors 
    Constructor Description
    FlowImpl​(java.util.Map<E,​java.lang.Double> flowMap)
    Constructs a new flow

  • Method Summary

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

    Methods inherited from class java.lang.Object

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

    Methods inherited from interface org.jgrapht.alg.interfaces.FlowAlgorithm.Flow

    getFlow

  • Constructor Details

    • FlowImpl

      public FlowImpl​(java.util.Map<E,​java.lang.Double> flowMap)
      Constructs a new flow
      Parameters:
      flowMap - the mapping defining the flow on the network

  • Method Details

    • getFlowMap

      public java.util.Map<E,​java.lang.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.