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

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

Concepts

  • [DM4-7] Network models
    Network models are crucial in some application domains, such as Navigation (roads etc.), but also in utility applications (facilities like pipes etc.) In this topic should be treated: - The network model in the database domain - Graph based NoSQL databases - Topology of network models - Data structures for storing network data - The Dijkstra algorithm - Overview on important applications