NW-Extension
NW-Extension copied to clipboard
NetLogo
This is the NetLogo Network Extension. For general information about NetLogo, see:
Currently, all the "path-to" primitives return the first path that Jung's implementation of Dijktra's algorithm finds. Maybe there should even be a way to get _all_ the acyclic paths from...
I would like to conditionally select a subset of a network based on link values to perform some functions, mainly [`distance-to`](https://ccl.northwestern.edu/netlogo/docs/nw.html#nw:distance-to), [`path-to`](https://ccl.northwestern.edu/netlogo/docs/nw.html#nw:path-to) and [`turtles-in-radius`](https://ccl.northwestern.edu/netlogo/docs/nw.html#nw:turtles-in-radius). So for example, I have a...
Currently, we're storing the `turtles` data structure which dictate the order in which the rows are generated in a set, so there is no guaranteed order.
I am trying to use nw:weak-component-clusters to remove clusters in which my agents get stuck when I traverse the graph. However, it seems it is not sensitive to directed links....
When I run a netlogo code with _nw:weak-component-clusters_ in it, it returns the components in a different random order each time, even when random-seed is specified. I've tried with netlogo...
Hello, I would like to be advised of a feature that allows me to find all potential paths to a turtle in NetLogo using network extension. For example in my...
Dear NW devs, sometimes, when working with NW from a headless netlogo, the dispose method of the NW extension throws an error. The error described here: https://github.com/NetLogo/NetLogo/issues/1766 I think it...
This got published today: https://www.nature.com/articles/s41598-019-41695-z A Java implementation is available at https://github.com/CWTSLeiden/networkanalysis. I haven't looked at any of it in details, but it might warrant future consideration.
I'm doing some exploration and found that if you have three nodes (a) (b)---(c), where (a) is isolated and the other two are connected by an undirected link, then when...
