1. V

    Dijkstra's Algorithm Problem

    Hi Maths Help Forum, I have a problem which I have tried to solve with Dijkstra's Algorithm - As this is the first time I have used Dijkstra's I am unsure if I am correct, my solution seems too simple :P O A B C D E H O - 9 - - - 7 - A - - 3 2 - - - B - - - 7 - 3 - C - - - - 6 - 7...
  2. V

    Hi Maths Help Forum /Wave

    My Names Phil and I have a maths question I would like some help on ^_^ Currently trying to get into Dijkstra's Algorithm
  3. L

    Dijkstra's Algorithm

    Hello, What is the simpliest proof of Dijkstra's Algorithm ?Like for Euclidean algorithm, we can just say gcd(a,b)=gcd(b,r) and we're done.
  4. E

    Can you check out my solutions related to Dijkstra Algortihm

    My homework related to Dijkstra Algortihm and Message Transmission. I need your guidance and help to complete this assignment. I've already struggled with the first two questions (Even though, I'm not sure whether they are correct) and the rest of them, I couldn't complete...That's why I need...
  5. A

    Understanding Dijkstra

    Hey, I havnt done dijkstra for a while and im having trouble understanding the universities notes etc. For a very simple graph, nodes 1, 2, 3 {1,2} = length 2 {1, 3} = length 3 {2, 3} = length 2 Now, naturally, i'd have though Dijkstra's spanning tree starting from node 3 would be {2...
  6. A

    How to modify Dijkstra's Algorithm to find the fastest path between 2 points...

    In a book I am working through I have been given a problem where a graph represents an electronic information network. The vertices are computer installations and the arcs/edges are direct links between them. The weights on the edges are data rates [the higher the number, the faster the link]...
  7. S

    dijkstra's algorithm

    Using the dijkstra's algorithm find the shortest path from node c to node f, shown in the attached graph.:confused: Any help would be greatly appreciated!
  8. R

    LINEAR OPTIMIZATION PROBLEM (Dijkstra's algorithm)

    Dijkstras algorithm does not work for graphs in which some weights are negative. A Natural approach to overcome this problem would be the following: To find a shortest path between two vertices in a graph with some negative weights, determine the minimium weight δ<0 among all the edges of...