Credits: Jonathan de Halleux aka "Peli" for the very nice QuickGraph Library.
Nodes to handle a graph data structure.
Just a few nodes for a start. Tell me what nodes you need as well, to work with graphs in your project.
wow! nifty late night surprise!
bug report: set Dag algorithm and i get an exception / red node
wow, totally forgot that this exists... no plans on that, but you can look into the C# file of the shortest path and see whether you can make your own implementations. which algorithms are you looking for?
it is possible to import it to VL of course. but it would need a deeper look...
For what i´m planing (geometry topology decomposition) i would need elements from the whole library, it would be great to have it in vl.
This is and example using shortest path with the triangle center Z coordinate as height, avoiding the hills, the left diagram is the unfolded triangle path.
anonymous user login