Tweet
window.twttr = (function (d, s, id) { var js, fjs = d.getElementsByTagName(s)[0], t = window.twttr || {}; if (d.getElementById(id)) return; js = d.createElement(s); js.id = id; js.src = "https://platform.twitter.com/widgets.js"; fjs.parentNode.insertBefore(js, fjs); t._e = []; t.ready = function (f) { t._e.push(f); }; return t; } (document, "script", "twitter-wjs"));

Graph of ds106 interlinked blog posts

From:

mhawksey

Uploaded on:

September 20, 2012

Description:

The graph is directed.

The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.

Overall Graph Metrics:

Vertices: 715

Unique Edges: 549

Edges With Duplicates: 0

Total Edges: 549

Self-Loops: 29

Reciprocated Vertex Pair Ratio: 0

Reciprocated Edge Ratio: 0

Connected Components: 211

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 57

Maximum Edges in a Connected Component: 63

Maximum Geodesic Distance (Diameter): 14

Average Geodesic Distance: 3.623134

Graph Density: 0.00101858925388337

Modularity: 0.956043

NodeXL Version: 1.0.1.224

The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.

The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.

Overall Graph Metrics:

Vertices: 715

Unique Edges: 549

Edges With Duplicates: 0

Total Edges: 549

Self-Loops: 29

Reciprocated Vertex Pair Ratio: 0

Reciprocated Edge Ratio: 0

Connected Components: 211

Single-Vertex Connected Components: 0

Maximum Vertices in a Connected Component: 57

Maximum Edges in a Connected Component: 63

Maximum Geodesic Distance (Diameter): 14

Average Geodesic Distance: 3.623134

Graph Density: 0.00101858925388337

Modularity: 0.956043

NodeXL Version: 1.0.1.224

The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.

Tags: