I imported your edge list into NodeXL. Here are the overview stats:
|
Metric |
Value |
|
Graph
Type |
Directed |
|
Unique
Edges |
1,612 |
|
Edges With
Duplicates |
0 |
|
Total
Edges |
1,612 |
|
Self-Loops |
0 |
|
Vertices |
136 |
|
Graph
Density |
0.087799564 |
So, it is not a complete graph, which would have a density of "1".
It is a fairly dense graph, however:
If we apply some clustering, we get:
I think there is some evidence for two major
clusters in the data.
A circle layout may not be that effective:
I think a grid may be a better lay out for some
purposes: here only the strongest connected patterns are highlighted.
A force-minimization layout with name labels for nodes:
Here I have filtered out all the "heavy hitters" - things with lots of
in-degree to focus on things that point to things that few things point to
and are themselves not pointed to too much:
Filtering away the edges yields: