boostorg / boostorg/graph

Algorithm for generating a random Flow Network/Graph

Open
#346 1 comment 0 reactions 0 assignees View on GitHub
generator priority: low
Dominant language
C++
Stars
392
Forks
239
Avg merge
1d 11m
Merged PRs (30d)
20

Description

Dear all,

Recently, I was working on a Flow Decomposition Problem, and found out that there are not many datasets for large valid flow networks. Nor could I find any existing software to generate such a Network/Graph. Are there any plans to develop such an algorithm within Boost. If yes, I would definitely like to contribute towards it.

Basically, by a valid flow network, I mean that there will be certain vertices as sources with `input_flow = 0` , certain vertices as sinks `output_flow = 0` , and rest all vertices should follow conservation of flow, i.e., `input_flow = output_flow`

Thank you,
Bashar Ahmed.

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.