The structure of a dynamically adaptive hypertext network, as coded in the underlying connection strength, must in some way be communicated to its browsers. We opted for a system in which out-going links from a particular node are ordered according to their connection strength: the strongest connection would appear on top, weaker connections on the bottom of the list. This principle has already been outlined by [Tomek, Maurer & Nassar, 1993] and [Kaplan, Fenwick & Chen, 1993]
To avoid extensive scrolling, the ordered list of out-going connections was sliced in packages of 10, with the possibility to browse through the list by selecting a 'next 10 items' hyperlink.