Living Textbook
Dashboard
Show
Topics
Instances
Abbreviations
References
Learning outcomes
Open map
List
[DM-02-015] The network model
×
You've loaded this page without map support, so map tools will not work. Open this page
with map
instead.
This topic is forthcoming.
Tags
Forthcoming
vector and object data models
Learning outcomes
189 - Create an adjacency table from a sample network
Create an adjacency table from a sample network
191 - Create an incidence matrix from a sample network
Create an incidence matrix from a sample network
296 - Define the following terms pertaining to a network: Loops, multiple edges, the degree of a vertex, walk, trail, path, cycle, fundamental cycle
Define the following terms pertaining to a network: Loops, multiple edges, the degree of a vertex, walk, trail, path, cycle, fundamental cycle
319 - Demonstrate how a network is a connected set of edges and vertices
Demonstrate how a network is a connected set of edges and vertices
322 - Demonstrate how attributes of networks can be used to represent cost, time, distance, or many other measures
Demonstrate how attributes of networks can be used to represent cost, time, distance, or many other measures
334 - Demonstrate how the star (or forward star) data structure, which is often employed when digitally storing network information, violates relational normal form, but allows for much faster search and retrieval in network databases
Demonstrate how the star (or forward star) data structure, which is often employed when digitally storing network information, violates relational normal form, but allows for much faster search and retrieval in network databases
804 - Discuss some of the difficulties of applying the standard process-pattern concept to lines and networks
Discuss some of the difficulties of applying the standard process-pattern concept to lines and networks
999 - Explain how a graph (network) may be directed or undirected
Explain how a graph (network) may be directed or undirected
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
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
1426 - List definitions of networks that apply to specific applications or industries
List definitions of networks that apply to specific applications or industries
Related topics
[DM-02-013] The topological model
[DM-02-014] Classic vector data models
[FC-05-022] Geometric Primitives and Algorithms