How can I select the starting path for the Edmonds-Karp algorithm if all the paths are the same length? In this case, maximum flow changes according to path sequence decision.
How to start Edmonds-Karp implementation if all the paths have same lengths?
1.3k views Asked by Gary Leather At
1
There are 1 answers
Related Questions in C++
- How to immediately apply DISPLAYCONFIG_SCALING display scaling mode with SetDisplayConfig and DISPLAYCONFIG_PATH_TARGET_INFO
- Why can't I use templates members in its specialization?
- How to fix "Access violation executing location" when using GLFW and GLAD
- Dynamic array of structures in C++/ cannot fill a dynamic array of doubles in structure from dynamic array of structures
- How do I apply the interface concept with the base-class in design?
- File refuses to compile std::erase() even if using -std=g++23
- How can I do a successful map when the number of elements to be mapped is not consistent in Thrust C++
- Can std::bit_cast be applied to an empty object?
- Unexpected inter-thread happens-before relationships from relaxed memory ordering
- How i can move element of dynamic vector in argument of function push_back for dynamic vector
- Brick Breaker Ball Bounce
- Thread-safe lock-free min where both operands can change c++
- Watchdog Timer Reset on ESP32 using Webservers
- How to solve compiler error: no matching function for call to 'dmhFS::dmhFS()' in my case?
- Conda CMAKE CXX Compiler error while compiling Pytorch
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in NETWORK-FLOW
- Decreasing the capacity of an edge in a flow graph
- Optimization trading items - min cost max flow
- setting the network algorithm in cplex but the solution was obtained with dual simplex
- how to implement in AMPL unsplittable flow and origin and destination contraint for a flow?
- Find maximum s-t in a cut in a flow network
- Algorithm question about assigning chores to children (ford-fulkerson)
- How to find a shortest path for edge capacity to meet demand?
- Creating network flow from Pandas DataFrame
- How can one solve a network flow problem with storage tanks?
- Iterating through a Tuple - Network Flows
- How to solve a circulation and demand problem with Ford-Fulkson if there is a lower bound for outgoing flow from a node?
- Ways to fullfil NaN Values for Intrusion Detection with ML, Unsupervised ML
- Network Flow Dataframe - Merging Memory Error - Unable to allocate array with shape and data type
- Why does my AMPL code keep giving this error?
- Telling two paths apart in a road network graph?
Related Questions in EDMONDS-KARP
- Why in Edmonds Karp or Ford Fulkerson Algorithm the time complexity of BFS or DFS respectively is O(E) rather than O(V+E)?
- Does Hungarian algorithm have better time complexity than the Edmonds-Karp algorithm?
- How to save last BFS of Edmonds-Karp algorithm?
- How to define cut set with Edmonds Karp Impl?
- How to use custom edge implementation with EdmondsKarp max flow algorithm
- Edmonds–Karp time complexity
- How can I use the Edmonds & Karp Algorithm for residual graph
- Efficient, max-flow algorithm to route as many people as possible to one location?
- Boost max flow algorithms do not compile. error: forming reference to void
- Finding max flow of an undirected graph using Edmonds-Karp
- Java JUNG EdmondsKarpMaxFlow getting stuck in infinite loop
- How to get flow for every edge using Jung's Edmonds Karp?
- An O(n * log(n)) algorithm for maximum st-flow in a directed planar graph (Borradaile, Klein)
- Why are the elements in my heapq not ordered python?
- Why is the complexity of Edmonds-Karp algorithm lesser than Ford-Fulkerson's?
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
I think there is a problem with how you handle capacities at the vertices. The usual way this is done is by splitting the vertex v in two vertices v' and v'' and adding an edge between v' and v'' with the capacity of the vertex. All edges connected to v(i.e. for which v is destination) should be connected with v' in the new graph and all edges from v should start from v'' in the new graph.
You probably know that when you let flow x-a-b-y 3 you add to the capacity of the reverse edges. In that case you will add the edges a x 3, b a 3, y b 3. If you do the graph representation as I described you will see that there is additional flow you can use in the first case(I think it can pass through x-a-d-c-b-y, but have not checked it).
The selection of the shortest path should not change the answer - as I mentioned in my comment we only select the shortest path on each step to avoid bad cases where the performance suffers, but the answer is always the same.
Hope this answer helps.