...

**Shortest paths** - shortest distance between two nodes. For example the shortest path from **Lenore **to **Mary** is through **Rupert** and not through **Chris **and **Jessica**.

**Weight** - strength of the tie represented by the thickness of the edges between nodes. In the example below, the edge between **Lenore** and Bob **Chris **is the strongest.

**Directionality** - is the connection one-way or two-way? In the example below, and in most directed networks, directionality is indicated by arrows.

**In-degree** - is calculated by determining the number of edges that point to a node, for example Bob **Chris **has an in-degree of 3 and Doug **Rupert** only has an in-degree of 1

**Out-degree** - is calculated by determining the number of edges that point away from a node, for example Bob **Chris **has an out-degree of 1 and Doug **Rupert** has an out-degree of 3.