boostorg / boostorg/graph

Algorithm for generating a random Flow Network/Graph

未关闭
#346 1 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看
generator priority: low
主要语言
C++
星标
392
派生
239
平均合并
1 天 11 分钟
30 天内合并 PR
20

描述

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.

贡献指南

打开贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。