This lesson's interactive features are locked, please to keep using them
Directed and Undirected Graphs
Remember, weighted and unweighted graphs are not the same! Similarly, directed and undirected graphs are quite different, and in this chapter we'll be discussing the Bellman-Ford algorithm, which works on directed graphs.
Let's begin by reviewing these graph types.
Undirected Graphs
An undirected graph is a set of nodes connected by edges that are bidirectional. That is, any edge can be traversed in either direction. The graphs that we dealt with in the last chapter were all undirected.
Directed Graphs
A directed graph is a set of nodes connected by edges, with each edge having a direction associated with it. Edges are usually represented by arrows pointing in the direction that the graph can be traversed.
A tree structure is an example of a directed graph. We traverse trees from top to bottom, or from root to leaves.
