Let's turn our attention away from the smaller graphs we've been working with towards the larger graph of followers provided by the
twitter_combined.txt file. This contains over 2.4 million edges and will provide a more interesting sample to work with.
One of the simplest metrics to determine about a whole graph is its density. For directed graphs, this is defined as the number of edges |E|, over the number of vertices |V| multiplied by one less than itself.
For a connected graph (one where every vertex is connected to every other vertex by an edge), the density would be 1. By contrast, a disconnected graph (one with no edges) ...
Get Clojure for Data Science now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.