boostorg / boostorg/graph

Algorithm for generating a random Flow Network/Graph

Offen
#346 1 Kommentar 0 Reaktionen 0 zugewiesene Personen Auf GitHub ansehen
generator priority: low
Vorherrschende Sprache
C++
Sterne
392
Forks
239
Ø Merge
1 T. 11 Min.
Gemergte PRs (30 T.)
20

Beschreibung

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.

Beitragsleitfaden

Beitragsleitfaden öffnen

Bewertung

Dieses Issue wurde noch nicht bewertet.

Neue Issues direkt in Ihr Postfach

Eine kurze Übersicht über anfängerfreundliche GitHub-Issues.