Network Problem Shortest Path

Distances
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

To
2
2

3
5

4
1

5
10 5

6
12 10 15

10

11

12

13

14

15

16

7 13 7 8 7

From

The best route is

1 3 5 8

Which gives a total of

17

Follow the steps to enable your Shortest Path Problem Solver.

>> Shortest Path problems are one of the base operations of the network problems.

This application is prepared to solve a shortest path problem with 16 nodes including the starting node(node 1) and ending node(no !!! !!! >> 1) If there is no connection between two nodes, leave it empty (Do not write "0"). If you have less number of nodes, leave the unnecessary nodes completely empty (Do not write "0"). The shortest route and the total amount of distance will be shown under the table after calculation. Your Shortest Path Problem Solver is ready to use. Following steps are for online use. Visit the site below:

Just enter the distances between nodes to table. Rows represents which node you are coming "From" and columns represent which

http://www.spreadsheetweb.com/getting_started.htm
You will only need the username and password to create your Shortest Path Problem Solver. 2) Visit the site below:

http://trial.spreadsheetweb.com/spreadsheetweb/
Login to page with your new account information. 3) >> >> Click "Add Web Application" to upload this file. Your Shortest Path Problem Solver will be created automatically. You can simply use the Shortest Path Problem Solver from that link or place it on your website. Your Shortest Path Problem Solver will look like: In order to see more online applications created with PSW you can check the link below:

http://www1.spreadsheetweb.com/SpreadSheetWEB/Output.aspx?ApplicationId=8f3dc077-38e4-4bb1-bfa http://www.spreadsheetweb.com/demos.htm

Copyright (c) 2009 Pagos, Inc. http://www.pagos.com/

e(node 1) and ending node(node 16) via Dynamic Programming.

and columns represent which node you are going "To".

8f3dc077-38e4-4bb1-bfaf-2d6071d61b63