1 / 7

Shortest Path Problem Solutions Evaluation for Discrete Optimization Assignment

Find the shortest path from node s to node t in various test graphs of different sizes. Submit solutions by email with code and report in PDF format. Working in pairs allowed. Use Python for implementation.

hfuller
Download Presentation

Shortest Path Problem Solutions Evaluation for Discrete Optimization Assignment

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Discrete OptimizationAssignment 1 Shortest paths Slides available online https://project.inria.fr/2015ma2827/

  2. The Shortest Path Problem s Find the shortest path from s to t v0 3 2 Length of path = Σ Length of arcs -1 v1 v4 3 1 2 6 v2 v5 3 5 -3 v3 2 v6 1 7 v7 t

  3. The Shortest Path Problem Find the shortest path from s to t v0 3 2 s Length of path = Σ Length of arcs -1 v1 v4 3 1 2 6 v2 v5 3 5 -3 v3 2 v6 t 1 7 v7

  4. The Shortest Path Problem Find the shortest path from s to t v0 3 2 s Length of path = Σ Length of arcs -1 v1 v4 3 1 2 6 v2 v5 3 5 -3 v3 2 v6 t 1 7 v7

  5. Task • 5 test graphs (from 100 to 100000 nodes) • Compute several shortest paths • Implement any algorithm you like • Some graphs have special properties!

  6. Submission • Submit by e-mail: ecp.ma2827@gmail.com Instructions: https://project.inria.fr/2015ma2827/ • We want solutions to 5 tests, code producing those, report in PDF format • Working in pairs is allowed. Teams should be registered (ecp.ma2827@gmail.com) before 8th April, 2016

  7. Use Python! • We recommend Python 2.7 and Numpy • Third-party implementations of graph algorithms are not allowed • If you desperately need other language then talk to us (ecp.ma2827@gmail.com)

More Related