Monks,
I have just been in correspondence with Jarkko Hietaniemi the author of the excellent Graph::Directed modules with reference to using them to store graphs with ~3000 nodes and ~1.5million edges. He believes that his module will not scale well to graphs of this size and wonders if the native perl data structures will begin to "creak". So I have two questions off the back of this.
1. Seeing as Graph::Directed is back by hashes, what is a realistic maximum size for the capacity of a hash or an array in Perl given factors such as the hashing function and local memory etc.
2. As I insert this large graph into the Graph::Directed module I note what appears to be an exponential slowdown as I insert edges. Clearly this is in relationship to the datastructure backing the Graph object, but does anyone know the big-O notation complexity of inserting edges and nodes into the data structures used by Graph::Directed.
I look forward to your replies
____________In reply to The Upper Limit of Perl's Native Data Structures by arunhorne
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |