Package org.graph4j.flow

package org.graph4j.flow
Algorithms related to flows in transportation networks.
  • Class
    Description
    DinicMaximumFlow
    /** Implements the Dinic algorithm for finding the maximum flow in a network.
    EdmondsKarpMaximumFlow
    The Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a network.
    FlowData
    Utility class for representing the flow of a network.
    InvalidFlowException
     
    MaximumFlowAlgorithm
    Contract for algorithms that computeMaximumFlow a maximum flow in a transportation network.
    MaximumFlowBase
     
    PushRelabelMaximumFlow
    The Push-Relabel algorithm maintains a preflow (where flow into a node can exceed flow out of it) and repeatedly pushes excess flow from overflowing vertices to neighboring vertices or relabels the height of the overflowing vertices to find new paths.