Re:Solving the minimum cut problem for undirected graphs
by armanboyaci on Wednesday April 17, 2024 @08:21PM
(#40071626)
You can compute the max-flow of an undirected graph. The edges have capacities and in the undirected case you assume that capacity can be used in both 'directions'.
[ Parent
| on HN ]
There are no comments on this comment yet.