A list implementation where we keep a master list of all the vertices in the Graph object and then each vertex object in the graph maintains a list of the other vertices that it is connected to.
A matrix implementation where each of the rows and columns represent a vertex in the graph, and where if two vertices are connected by an edge, they are considered adjacent.
The largest subset of vertices \(C \subset V\) such that for every pair of vertices \(v,w \in C\) we have a path from \(v\) to \(w\) and a path from \(w\) to \(v\text{.}\)
A topological sort takes a directed acyclic graph and produces a linear ordering of all its vertices such that if the graph G contains an edge (v,w) then the vertex v comes before the vertex w in the ordering.
Each message starts with a time to live (ttl) value set to some number greater than or equal to the number of edges between the broadcast host and its most distant listener. Each router gets a copy of the message and passes the message on to all of its neighboring routers. When the message is passed on the ttl is decreased. Each router continues to send copies of the message to all its neighbors until the ttl value reaches 0.
A vertex (also called a “node”) is a fundamental part of a graph. It can have a name (also called a “Key”). A vertex may also have additional information also called a (“payload”).
