9.6.05
Scale-free geometry in OO programs
Scale-free geometry in OO programs
Alex Potanin, James Noble, Marcus Frean, Robert Biddle
The only paper on OO that I've really enjoyed reading in the last few years. Points out that the graph representing an OO program is scale-free, meaning that it enjoys a fractal structure similar to the web. One might expect such graphs to have a "typical" scale, where each node has, say, 2.3 outgoing edges on average. But there is no typical scale, because there are lots of nodes with just a few outgoing edges, but also a few nodes with a lot of outgoing edges. Ditto for incoming edges!
Alex Potanin, James Noble, Marcus Frean, Robert Biddle
The only paper on OO that I've really enjoyed reading in the last few years. Points out that the graph representing an OO program is scale-free, meaning that it enjoys a fractal structure similar to the web. One might expect such graphs to have a "typical" scale, where each node has, say, 2.3 outgoing edges on average. But there is no typical scale, because there are lots of nodes with just a few outgoing edges, but also a few nodes with a lot of outgoing edges. Ditto for incoming edges!
