Networks

[Daenerys Targaryen]

So I've got a few questions and here they are:

1. When finding critical paths, is there an actual method to figure it out or is it just trial and error?

2. Same as Qu.1 but for shortest paths?

3. In my text book I've got questions which gives you a network, and it tells us it's a network of streets and freeways. It then asks me to label the paths that are 'freeways' - are we expected to do this in an exam, like know what they're expecting a freeway to be? *this is for network flow  - i can also upload a picture if anyone wants me to*

Thanks.

[brenden]

So I've got a few questions and here they are:

1. When finding critical paths, is there an actual method to figure it out or is it just trial and error?

2. Same as Qu.1 but for shortest paths?

3. In my text book I've got questions which gives you a network, and it tells us it's a network of streets and freeways. It then asks me to label the paths that are 'freeways' - are we expected to do this in an exam, like know what they're expecting a freeway to be? *this is for network flow  - i can also upload a picture if anyone wants me to*

Thanks.

1. Nah no method like minimum spanning trees, just have a look and see what the highest number you can get is.
2. Yeah pretty much the same. But if you get a completed network the shortest path will have the biggest float time, I doubt that's of much use though, especially because I only realised it then lol.
I have no idea how to label streets and freeways. Don't think it was in my textbook, although I did skip some of the chapter.