current community

your communities

more stack exchange communities

Stack Exchange
tour help
Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.
up vote 4 down vote favorite

I have here a directed graph that I used to perform Dinic's algorithm to find maximum flow. I need to adjust this graph and this algorithm to work with dynamic trees (i.e. the Sleator-Tarjan algorithm).

I just wish I could find an image source or video that can help me visualize the steps. Something like this is really close. But I just really want to find thing to lead me step by step in a visual way or a way that doesn't involve pseudocode.

share|improve this question
    
Being able to understand an algorithm from its general description (i.e. some code) is a central part of algorithmics. I'm afraid there is no shortcut; most clear examples are bound to miss cases. I suggest you 1) look at the reasoning for correctness (that proof is bound to contain essential information) and 2) build your own examples with some inputs, the code and a stack of paper. –  Raphael♦ Aug 13 '13 at 8:11
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.