Undirected Graphs

• All examples so far have been examples of “undirected” graphs.

• In an undirected graph the edges between vertices are valid in either direction. (If you can get to node B from node A using edge E then you can get from A from B using the same edge E.