3.1 Information gathering
3.1.1 Exploration strategy
In section 2.1, cyberspace was modelled as a graph. Two classical graph-traversal algorithms are appropriate for gathering information about the connective structure of this graph: the depth-first search and the breadth-first search. Since they are made with adjacency lists, both searches require time proportional to . The graph can be represented with an adjacency-structure (linked-lists).
 Other exploration strategies are presented in section 5.1 "Improved search strategy" on page 33.
Cyberspace geography visualization - 15 October 1995
Luc Girardin, The Graduate Institute of International Studies