It's UWAweek 47

help3001

This forum is provided to promote discussion amongst students enrolled in CITS3001 Advanced Algorithms.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 202 articles.
Currently 20 other people reading this forum.


 UWA week 40 (2nd semester, week 10) ↓
SVG not supported

Login to reply

👍?
helpful
3:53pm Fri 4th Oct, ANONYMOUS

Hi there! It's me with my lecture questions again. I tried rewatching the lectures and going to a lab facilitator to ask but they were confused too so I have a few questions this time: 1. In the Ford-Fulkerson problem slide (slide 18) is it the case that it will just repeat the path {s, a, b, t} and {s, b, a, t} over and over again or is this just a worst case scenario. If not, why would it take that path instead of the shorter {s, a, t} and {s, b, t}. 2. For Edmonds-Karp (slide 21), could you explain what the "ladder" meant ? Is it because if we saturate u v, we can only use v u to release u v and it repeats over and over like the Ford-Fulkerson problem slide? (i.e. it keeps getting longer and longer because you now can't go through u but must go through v)? A diagram would help alot! 3. For cut flow (slide 26), how is it that sum V f(u, v) = 0? Thanks for the help for my previous questions, Gozz and Max, you have been really helpful for my understanding!

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy