Re: Shortest Path Topology
I have a couple of search mechanisms written in NetLogo at...
...from your question you would probably be best looking at the example involving "patches with obstacles". This finds the shortest path between a start & goal position.
--- In email@example.com, "Ali" <malekzadeh_a_2004@...> wrote:
> I am beginner in Netlogo and I have an inquiry for moving the agents and I appreciate if you can help me regarding this question.
> Actually, I want to move the agents to a particular location via specific patches (e.g blue color patches) by using shortest path topology.
> I really apprecaite if anyone can help me.
> Many thanks