Union

[Tobes]

Hi

JIT is amazing, thanks!

Does anyone know if it would be possible/easy to write a Graph Union
operation - a bit like the Graph.Op.sum() function only where there
doesn't have to be a common node?

http://mathworld.wolfram.com/GraphUnion.html

Many thanks

Tobin

[Tobes]

I'm wondering if this was a dumb question?

I'm looking to have a graph with disconnected sub-graphs, is that a no-
no for JIT?

Thanks

Tobin