
Beyond the Adjacency Matrix
We have 5 nodes \(\{A, B, C, D, E\}\). Let’s build the \(5 \times 5\) reachability matrix. Diagonals are blocked (--) — a node trivially reaches itself via a length-0 path, but we set the diagonal aside to focus on distinct pairs.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | ? | ? | ? | ? |
| B | ? | -- | ? | ? | ? |
| C | ? | ? | -- | ? | ? |
| D | ? | ? | ? | -- | ? |
| E | ? | ? | ? | ? | -- |
Let’s trace which nodes can be reached by starting a directed walk at node A.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0 | 1 | 1 | 1 |
| B | ? | -- | ? | ? | ? |
| C | ? | ? | -- | ? | ? |
| D | ? | ? | ? | -- | ? |
| E | ? | ? | ? | ? | -- |
Let’s trace which nodes can be reached by starting a directed walk at node B.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0 | 1 | 1 | 1 |
| B | 0 | -- | 0 | 1 | 1 |
| C | ? | ? | -- | ? | ? |
| D | ? | ? | ? | -- | ? |
| E | ? | ? | ? | ? | -- |
Same trace for node C — and a pattern emerges: nothing ever points into A or B, the two pure sources.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0 | 1 | 1 | 1 |
| B | 0 | -- | 0 | 1 | 1 |
| C | 0 | 0 | -- | 1 | 1 |
| D | ? | ? | ? | -- | ? |
| E | ? | ? | ? | ? | -- |
The last two rows are the quickest — and the most informative.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0 | 1 | 1 | 1 |
| B | 0 | -- | 0 | 1 | 1 |
| C | 0 | 0 | -- | 1 | 1 |
| D | 0 | 0 | 0 | -- | 0 |
| E | 0 | 0 | 0 | 1 | -- |
Tracing every row fills the matrix — and the completed matrix reveals each node’s role at a glance.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0 | 1 | 1 | 1 |
| B | 0 | -- | 0 | 1 | 1 |
| C | 0 | 0 | -- | 1 | 1 |
| D | 0 | 0 | 0 | -- | 0 |
| E | 0 | 0 | 0 | 1 | -- |




| Whole Graph State | Defining Pairwise Condition |
|---|---|
| Strongly Connected | every pair of nodes is pairwise strongly connected. |
| Unilaterally Connected | every pair is at least unilaterally connected, and at least one pair is no better than unilaterally connected. |
| Weakly Connected | every pair is at least weakly connected, and at least one pair is no better than weakly connected. |

| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| 1 | – | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | – | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 1 | – | 1 | 1 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | – | 1 | 1 | 1 | 1 |
| 5 | 1 | 1 | 1 | 1 | – | 1 | 1 | 1 |
| 6 | 1 | 1 | 1 | 1 | 1 | – | 1 | 1 |
| 7 | 1 | 1 | 1 | 1 | 1 | 1 | – | 1 |
| 8 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | – |

| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| 1 | – | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | – | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | – | 1 | 1 | 1 | 1 | 1 |
| 4 | 1 | 0 | 1 | – | 1 | 1 | 1 | 1 |
| 5 | 1 | 0 | 1 | 1 | – | 1 | 1 | 1 |
| 6 | 1 | 0 | 1 | 1 | 1 | – | 1 | 1 |
| 7 | 1 | 0 | 1 | 1 | 1 | 1 | – | 1 |
| 8 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | – |

| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| 1 | – | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 2 | 1 | – | 1 | 1 | 1 | 1 | 0 | 1 |
| 3 | 1 | 0 | – | 1 | 1 | 1 | 0 | 1 |
| 4 | 1 | 0 | 1 | – | 1 | 1 | 0 | 1 |
| 5 | 1 | 0 | 1 | 1 | – | 1 | 0 | 1 |
| 6 | 1 | 0 | 1 | 1 | 1 | – | 0 | 1 |
| 7 | 1 | 0 | 1 | 1 | 1 | 1 | – | 1 |
| 8 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | – |
| A | B | C | D | E | F | G | |
|---|---|---|---|---|---|---|---|
| A | -- | 1 | 1 | 1 | 0 | 1 | 0 |
| B | 1 | -- | 1 | 1 | 0 | 1 | 0 |
| C | 0 | 0 | -- | 0 | 0 | 0 | 0 |
| D | 1 | 1 | 1 | -- | 0 | 1 | 0 |
| E | 1 | 1 | 1 | 1 | -- | 1 | 0 |
| F | 1 | 1 | 1 | 1 | 0 | -- | 0 |
| G | 1 | 1 | 1 | 1 | 0 | 1 | -- |


| Value | Meaning |
|---|---|
| \(C = 1.0\) | Strongly connected (all-ones matrix). |
| \(C < 1.0\) | Unilaterally or weakly connected (has zeros). |
| \(C = 0.0\) | Completely disconnected (all zeros). |

| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| 1 | -- | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 2 | 1 | -- | 1 | 1 | 1 | 1 | 0 | 1 |
| 3 | 1 | 0 | -- | 1 | 1 | 1 | 0 | 1 |
| 4 | 1 | 0 | 1 | -- | 1 | 1 | 0 | 1 |
| 5 | 1 | 0 | 1 | 1 | -- | 1 | 0 | 1 |
| 6 | 1 | 0 | 1 | 1 | 1 | -- | 0 | 1 |
| 7 | 1 | 0 | 1 | 1 | 1 | 1 | -- | 1 |
| 8 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | -- |
We now switch to a new undirected 5-node example. Nodes with direct connections get a geodesic distance of 1.0.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | 0 | ? | 1 | 1 | ? |
| B | ? | 0 | ? | ? | 1 |
| C | 1 | ? | 0 | 1 | 1 |
| D | 1 | ? | 1 | 0 | 1 |
| E | ? | 1 | 1 | 1 | 0 |
For non-adjacent nodes, we calculate the length of the shortest path connecting them.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | 0 | ? | 1 | 1 | 2 |
| B | ? | 0 | 2 | 2 | 1 |
| C | 1 | 2 | 0 | 1 | 1 |
| D | 1 | 2 | 1 | 0 | 1 |
| E | 2 | 1 | 1 | 1 | 0 |
We compute the remaining non-adjacent pair, representing the maximum distance in the graph.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | 0 | 3 | 1 | 1 | 2 |
| B | 3 | 0 | 2 | 2 | 1 |
| C | 1 | 2 | 0 | 1 | 1 |
| D | 1 | 2 | 1 | 0 | 1 |
| E | 2 | 1 | 1 | 1 | 0 |
For directed graphs, we follow the same process but respect the arrows (Sender \(\rightarrow\) Receiver) — back on the same digraph we used for reachability in Part 1.

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | 0 | ? | 1 | 1 | 2 |
| B | ? | 0 | ? | 2 | 1 |
| C | ? | ? | 0 | 2 | 1 |
| D | ? | ? | ? | 0 | ? |
| E | ? | ? | ? | 1 | 0 |
If a node \(i\) cannot reach node \(j\) via any directed path, their geodesic distance is Infinity (\(\infty\)).

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | 0 | \(\infty\) | 1 | 1 | 2 |
| B | \(\infty\) | 0 | \(\infty\) | 2 | 1 |
| C | \(\infty\) | \(\infty\) | 0 | 2 | 1 |
| D | \(\infty\) | \(\infty\) | \(\infty\) | 0 | \(\infty\) |
| E | \(\infty\) | \(\infty\) | \(\infty\) | 1 | 0 |

| A | B | C | D | E | Row Max (\(e\)) | |
|---|---|---|---|---|---|---|
| A | 0 | 3 | 1 | 1 | 2 | \(e(A) = 3\) |
| B | 3 | 0 | 2 | 2 | 1 | \(e(B) = 3\) |
| C | 1 | 2 | 0 | 1 | 1 | \(e(C) = 2\) |
| D | 1 | 2 | 1 | 0 | 1 | \(e(D) = 2\) |
| E | 2 | 1 | 1 | 1 | 0 | \(e(E) = 2\) |

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0.00 | 0.25 | 0.25 | 0.67 |
| B | 0.00 | -- | 0.33 | 0.33 | 0.00 |
| C | 0.25 | 0.33 | -- | 0.50 | 0.20 |
| D | 0.25 | 0.33 | 0.50 | -- | 0.20 |
| E | 0.67 | 0.00 | 0.20 | 0.20 | -- |
--): \(J_{ii}\) is trivially 1.
| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0.00 | 0.25 | 0.25 | 0.67 |
| B | 0.00 | -- | 0.33 | 0.33 | 0.00 |
| C | 0.25 | 0.33 | -- | 0.50 | 0.20 |
| D | 0.25 | 0.33 | 0.50 | -- | 0.20 |
| E | 0.67 | 0.00 | 0.20 | 0.20 | -- |

| A | B | C | D | E | |
|---|---|---|---|---|---|
| A | -- | 0.00 | 0.25 | 0.25 | 0.67 |
| B | 0.00 | -- | 0.33 | 0.33 | 0.00 |
| C | 0.25 | 0.33 | -- | 0.50 | 0.20 |
| D | 0.25 | 0.33 | 0.50 | -- | 0.20 |
| E | 0.67 | 0.00 | 0.20 | 0.20 | -- |