Links for Chapter 6
links
The number of possible shortest paths, i.e., pairs of vertices, choosable from a graph of any given size is given by the numbers in integer sequence A000522.
Relations, Networks, Flows
In this chapter the focus is squarely on networks (which mathematicians confusingly insist on calling graphs) and their potential for more relational understandings of space in giscience. As much of the code associated with the figures in this chapter shows, handling such structure elegantly is not something existing geospatial tools do well.
© 2023 David O’Sullivan