ch 38 graphs

• A graph is a set of vertices or nodes connected by edges or arcs. The edges may be one-way or two-way.
• In a directed graph the edges are all one-way.
• In an undirected graph, all edges are bidirectional.
• Weighted edges show there is a cost to traverse from one vertex to another.
• A router in a mapping program will calculate the total travel time of each possible path between two locations, and present the best one in order to minimise latency.