In most cases, the relationships that the constituent nodes of a graph represent can be thought of as undirectional. Such relationships do not impose any order on the relationship. Such edges are called undirected edges and the resultant graph is called an undirected graph. An undirected graph is shown here:

Some examples of undirectional relationships are as follows:

• Mike and Amine (Mike and Amine know each other).
• Node A and Node B are connected (this is a peer-to-peer connection).