Living Textbook
Dashboard
Show
Concepts
Instances
Contributors
External resources
Learning outcomes
List
700 - 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