term1 Definition1term2 Definition2term3 Definition3
Please sign in to your Google account to access your documents:
Graph
Uses of Graphs
Transport Networks, where the stations departure and arrival points are nodes and the routes are the edges.
The internet, where each devices is a vertex and the physical connection is an edge.
Latency
Adjacency List
A data Structure that stores a list of nodes with their adjacent nodes.
Adjacency Matrix
A data structure set up as a grid that shows whether there is an edge between each pair of nodes.
Advantages of an Adjacency List:
Good for graphs with fewer edges than nodes (a sparse graph)
Only stores data where there is an adjacency edge so less memory is required.
Advantages of an Adjacency Matrix:
Good for graphs with more edges than nodes (a dense graph)
Adjacencies can be identified more quickly as every combination is already stored
Tree
A connected, undirected graph with no cycles.
Root
The starting node in a rooted tree structure from which all other nodes branch off.
Parent
A type of node in a tree where there are further nodes below it.
Need help typing ? See our FAQ (opens in new window)
Please sign in to create this set. We'll bring you back here when you are done.
Discard Changes Sign in
Please sign in to add to folders.
Sign in
Don't have an account? Sign Up »
You have created 2 folders. Please upgrade to Cram Premium to create hundreds of folders!