Unformatted text preview:

Network OptimizationSlide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Network OptimizationEulerian Cycles in directed graphsJames Orlin 20102The initial network41257 896310 1113 141512Every node has the same number of arcs coming in as going out.3Determine a tree directed into node 141257 896310 1113 141512Determine a bfs (or dfs) tree directed into node 1.In the tree, each node has one arc coming out except node 1.4Order the arcs coming out of each node41257 896310 1113 141512The tree arc out of node j should be the last arc of A(j)5Create the walk41257 896310 1113 141512Start at node 1 and create a walk. Visit nodes of A(j) in order.6Continue the walk41257 896310 1113 141512Continue the walk.Visit nodes of A(j) in order.7Continue the walk41257 896310 1113 141512Continue the walk.Visit nodes of A(j) in order.8Continue the walk41257 896310 1113 141512Continue the walk.Visit nodes of A(j) in order.MITOpenCourseWarehttp://ocw.mit.edu15.082J / 6.855J / ESD.78J Network OptimizationFall 2010 For information about citing these materials or our Terms of Use, visit:


View Full Document

MIT 15 082J - Network Optimization

Download Network Optimization
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Network Optimization and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Network Optimization 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?