Living Textbook
Dashboard
Show
Topics
Instances
Abbreviations
References
Learning outcomes
List
1000 - Explain how a graph can be written as an adjacency matrix and how this can be used to calculateĀ topological shortest paths in the graph
×
You've loaded this page without map support, so map tools will not work. Open this page
with map
instead.
Explain how a graph can be written as an adjacency matrix and how this can be used to calculateĀ topological shortest paths in the graph
Topics
[DM-02-015] The network model
This topic is forthcoming.