collatz conjecture graph in processing

[ker2x]

i wrote a small app that graph the tree graph of the collatz conjecture.
the source code is available, but it's very ugly and memory inefficient.
it need a full rewrite, but it's a few hour of hack

here it is : http://ker.endofinternet.net/img/collatz/

[Timeroot]

This wouldn't by any chance be related to xkcd, would it?

Hmmmmm? 

[ker2x]

you mean http://xkcd.com/710/  ?
it's 2000% related 

[jehovajah]

As simple as this rule is the graph demonstrates short term and long term memory structure with local revision of learrning. It may be a basis for artificial learning in memory structures.

[kram1032]

cool app
Very rigid xD

[ker2x]

i rebuilt the same kind of program, using neo4j : http://github.com/ker2x/Collatz4Neo

i processed tens of milliions of node.
now trying with hundreds of millions of node.

The probleme is : how to visualize a graph with millions of node ? 
Obviously, my processing app can't draw that kind of huge graph 

about neo4j, it's a graph database that can be jound here : http://www.neo4j.org/

[jehovajah]

Thanks for the references. Very interesting tensor!