Algorithm for generating a random Flow Network/Graph

Open
#346 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
20/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
data

Research direction

No files, tests, or entry points are named. First clarify the generator's required inputs, network-size targets, source and sink behavior, flow representation, and validity guarantees; done would mean an agreed algorithm and corresponding Boost Graph implementation and tests.

Written by the indexing model from the issue text.

Description

generator priority: low

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.

Dominant language
C++
Stars
395
Forks
239
Avg merge
18h 50m
Merged PRs (30d)
20

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from boostorg/graph

All issues in boostorg/graph

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.