Dijkstra's Shortest Path Algorithm

1 collaborator

Ron Schildge (Author)

WHAT IS IT?

(a general understanding of what the model is trying to show or explain)

HOW IT WORKS

(what rules the agents use to create the overall behavior of the model)

HOW TO USE IT

(how to use the model, including a description of each of the items in the Interface tab)

THINGS TO NOTICE

(suggested things for the user to notice while running the model)

THINGS TO TRY

(suggested things for the user to try to do (move sliders, switches, etc.) with the model)

EXTENDING THE MODEL

(suggested things to add or change in the Code tab to make the model more complicated, detailed, accurate, etc.)

NETLOGO FEATURES

(interesting or unusual features of NetLogo that the model uses, particularly in the Code tab; or where workarounds were needed for missing features)

RELATED MODELS

(models in the NetLogo Models Library and elsewhere which are of related interest)

CREDITS AND REFERENCES

(a reference to the model's URL on the web if it has one, as well as any other necessary credits, citations, and links)

Comments and Questions

Please start the discussion about this model! (You'll first need to log in.)

Click to Run Model

patches-own [dist value]
globals [notVisited]

to setup
  ca
  ask patches[
   set dist 99999
   set value random 10 + 1
   set plabel dist
  ]
  ask patch min-pxcor max-pycor [
    set dist 0
  ]
  set notVisited patches
end 

to go
  while [count notVisited > 0]
  [
    let current min-one-of notVisited [dist]
    ask current [set pcolor white set plabel dist]
    ask current [
      ask neighbors4 [
        let newDist ([dist] of myself + value)
        if newDist < dist
        [set dist newDist]
      ]

    ]
    set notVisited notVisited with [self != current]
    ask patches with [dist < 99999][set pcolor gray]
  ]

  crt 1[
    set color red
    setxy max-pxcor min-pycor
    pd
    while[patch-here != patch min-pxcor max-pycor][
    face min-one-of neighbors4 [dist]
    fd 1
      set pcolor color
    ]
  ]
end

There is only one version of this model, created about 3 years ago by Ron Schildge.

Attached files

File	Type	Description	Last updated
Dijkstra's Shortest Path Algorithm.png	preview	Preview for 'Dijkstra's Shortest Path Algorithm'	about 3 years ago, by Ron Schildge	Download

This model does not have any ancestors.

This model does not have any descendants.

NetLogo