3.1 Information gathering

### 3.1.3 Distance matrix construction

From the adjacency matrix, the shortest edge-sequences to and from every resources are calculated. This is done by applying the classical shortest-path algorithm times, resulting in a complexity of . Another possibility is to use Floyd's algorithm which solves the all-pairs shortest-path problem in [Sedgewick, 1989].

Cyberspace geography visualization - 15 October 1995

Luc Girardin, The Graduate Institute of International Studies