https://github.com/zhaofeng-shu33/preflow

Preflow algorithm based on lemon C++
https://github.com/zhaofeng-shu33/preflow

Last synced: about 1 month ago
JSON representation

Preflow algorithm based on lemon C++

• Host: GitHub
• URL: https://github.com/zhaofeng-shu33/preflow
• Owner: zhaofeng-shu33
• Created: 2019-04-13T09:33:12.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2023-01-22T03:06:45.000Z (almost 2 years ago)
• Last Synced: 2024-10-15T09:09:34.534Z (3 months ago)
• Language: C++
• Size: 149 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Maximum Flow Algorithm (Preflow)

Implementation of preflow algorithm with a different 

**active node selection rules**.

[![Travis](https://travis-ci.com/zhaofeng-shu33/preflow.svg?branch=master)](

    https://travis-ci.com/zhaofeng-shu33/preflow)

## How to use

After successful compilation and link, you get an executable program called `lgf_compute`. You should use an LEMON graph file (digraph)

as input to this program, and the program print out the caculated result to the terminal. 

For example,  using provided test graph file, type `./lgf_compute --filename test.lgf` to finish the computation.

Selection Rules:

- Highest Relabel

- FIFO

- Relabel to front

Parallel Implementation:

- generic parallel