boostorg / boostorg/graph

Algorithm for generating a random Flow Network/Graph

Aperta
#346 1 commento 0 reazioni 0 assegnatari Vedi su GitHub
generator priority: low
Lingua principale
C++
Stelle
392
Fork
239
Merge medio
1g 11m
PR unite (30g)
20

Descrizione

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.

Guida per i contributori

Apri la guida per i contributori

Valutazione

Questa issue non è ancora stata valutata.

Ricevi le nuove issue nella tua casella

Un breve riepilogo di issue GitHub adatte ai principianti.