This repository has been archived by the owner on Oct 22, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 11
Flow algorithms work only for directed graphs? #22
Comments
Do you mean consider the same arc in both directions? If so, this could be
handled with dispatch I guess
…On Thu, Nov 1, 2018, 17:30 Simon Schoelly ***@***.*** wrote:
It looks like all the flow algorithms only work for directed graphs. Would
some of them work if we lift this restriction or would we need a new
implementation for that?
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#22>, or mute
the thread
<https://github.com/notifications/unsubscribe-auth/AHRRstHEUgb2_fDHhLoONdO6C3pdTsYDks5uqyG_gaJpZM4YHMg_>
.
|
It seems that this is a requirement for computing residual graph. I guess you could convert undirected graphs to directed graphs by assigning the same weight for the same arc. |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
It looks like all the flow algorithms only work for directed graphs. Would some of them work if we lift this restriction or would we need a new implementation for that?
The text was updated successfully, but these errors were encountered: