Graphs have varying degrees of connection. The higher the ratio of edges to vertices, the more connected the graph.
This graph represents a social network; people are vertices and edges are friendships.
Ted is adjacent to
Alice because an edge directly connects them.
We use a single line for an edge, but these friendships are bi-directional.
Patty is friends with
Ron is friends with
A path is vertices which are connected by any number of intermediate edges. The paths from
Patty could go
No path exists between
Ted. When no path exists between two vertices, a graph is disconnected.
What are the paths that connect
What edge could we add that would change this into a connected graph?