Chapter 9 - Graphs and Trees

Adjacency matrix

A data structure set up as a 2D array that shows whether there is an edge between each pair of nodes

Adjacency list

A data structure that stores a list of nodes with their adjacent nodes

Weighted graph

A graph that has a data value on each edge

Tree

A graph that has no loops or cycles

Undirected graph

A graph where the relationship is two-way

Graph

A mathematical structure that models the relationship between pairs of objects

Binary tree

A tree where each node can have up to two child nodes attached

Leaf

A type of node in a tree from which there are no more nodes below it

Parent

A type of node in a tree that has further nodes below it

Child

A type of node in a tree that has nodes above it

Node

Also known as a vertex - an object or point in a graph

Edge

Also known as an arc - a connection between nodes/vertices

Arc

Also known as an edge - relationship between two nodes

Vertex

Also known as an node - a point or object in a graph

Directed graph

One-way links between nodes on a graph

Root

The starting node in a rooted tree structure from which all other nodes branch off

Latency

The time delay when sending data between devices

Graph theory

The underlying mathematical principles behind the use of graphs