Hi David, On Thu, Jan 7, 2010 at 7:27 AM, David Joyner <[email protected]> wrote: > At some point I want to implement several graph-theoretic constructions > for work I hope to get funded for over the summer, so I will wait > until this patch is incorporated. They are > > > (1) the Havel-Hakimi construction (given a graphical degree sequence, > construct a graph having those degrees)
NetworkX already implements a function for the Havel-Hakimi construction. It's the function havel_hakimi_graph() [1] in the latest rc release of NetworkX. > (2) ring lattice graphs (as in Watts' Small Worlds), The Watts-Strogatz small-world networks are implemented in NetworkX as watts_strogatz_graph() [2]. Last year, I contributed a function to NetworkX for constructing a connected version of the Watts-Strogatz small-world graphs as part of my summer project. The relevant function is connected_watts_strogatz_graph() [3] and the project report [4] contains R code for constructing the Watts-Strogatz ring lattice. Am I correct to think that you want to implement the Havel-Hakimi and Watts-Strogatz constructions in Cython? [1] http://networkx.lanl.gov/reference/generated/networkx.havel_hakimi_graph.html [2] http://networkx.lanl.gov/reference/generated/networkx.watts_strogatz_graph.html [3] http://networkx.lanl.gov/reference/generated/networkx.connected_watts_strogatz_graph.html [4] http://sites.google.com/site/nguyenminh2/2009-02-27_csiro-report.pdf -- Regards Minh Van Nguyen
-- To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
