As our first example, let's create a simple graph. Remember the Giraffe Graph we talked about? Let's create one that is shown in the following figure:
This is a graph from the lecture given by Prof. Jeffrey D. Ullman at Stanford University on graphs and social Networks (http://web.stanford.edu/class/cs246/handouts.html). It is a giraffe graph with two strong cliques connected by a weak edge. The numbers are the betweenness centrality of each node, as calculated by the G-N algorithm.
Note
Fun facts about betweenness centrality: It shows how many paths an edge is part of; that is, its relevancy. High betweenness centrality is the sign of a bottleneck, a point of single failure; such edges need HA and probably alternate paths for rerouting, and they are susceptible to parasite infections and good candidates for a cut!
From the GraphX computational model, you can see that betweenness centrality would be represented as an edge property.
The nodes A, B,... are people, and...
