Notes and Tasks -*- org -*-
What if we only used 1 hash to hold all nodes and edges…, and what if nodes could hold other nodes in their edge list, and edges could hold other edges in their node list, what sort of structure would this be? A useful generalization of a graph?
Some notes in the stuff/ directory.
Prim’s algorithm
the clustering coefficient \begin{equation*} C = \frac{\text{number of closed connected triples}}{\text{number of connected triples}} \end{equation*}
http://en.wikipedia.org/wiki/Assortativity
Should take an optional :key function which defaults to node degree.
http://en.wikipedia.org/wiki/Random_graph
Both of the following types of random graphs
- [X] Edgar_Gilbert
- [X] Erdos-Renyi
like it or not, people will initially look for pictures
- graph-dot -> images in documentation
- graph-json -> images in documentation
http://web.mit.edu/newsoffice/2013/short-algorithm-long-range-consequences-0301.html