Show / Hide Table of Contents

Graph Library

Author: tonfilm
Date: 22 Aug, 2011
Category: plugin
Credits:

Jonathan de Halleux aka "Peli" for the very nice QuickGraph Library.

Download

64bit

1-vvvv_graphlib.zip
26 Mar, 2012 - 20:36
added error handling in shortest path node
0-graph.zip
22 Aug, 2011 - 21:13
old version, lacks error handling

Description

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.

Comments

Comments are no longer accepted.
Please create a new topic in the vvvv beta forum to discuss this contribution.
bo27
22 Aug, 2011 - 21:25

wow! nifty late night surprise!

sebl
30 Aug, 2011 - 11:13

super!

u7angel
01 Sep, 2011 - 10:31

thanks tebjan bug report: set Dag algorithm and i get an exception / red node

tonfilm
26 Mar, 2012 - 20:37

version updated. thanks for the report and rogerlette for testing.

patrick
03 Apr, 2013 - 09:46

FD (Graph) seems to have an issue with large data sets, see [ForceDirected (Graph) problems w/ large graphs](https://discourse.vvvv.org/t/ForceDirected (Graph) problems w/ large graphs).

dannielmach
04 May, 2013 - 04:22

very good!!!:)

lasal
10 Feb, 2017 - 15:51

Any plan to update this library? i need more algorithms ;) https://quickgraph.codeplex.com/documentation

or better, would it be possible to import it in vl?

tonfilm
12 Feb, 2017 - 21:20

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...

lasal
12 Feb, 2017 - 22:54

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.