B C D.

Example of directed and undirected graph. In an ideal example a social network is a graph of connections between people. So far we have been working with graphs with undirected edges. This means that an edge u v is not identical to edge v u.

Below is the example of an undirected graph. A directed edge is an edge where the endpoints are distinguishedone is the head and one is the tail. Two edges are parallel if they connect the same pair of vertices.

Web page linking The graph nodes are web pages and the edges represent hyperlinks between pages. A directed graph is a graph in which edges have orientation given by the arrowhead. We use the names 0 through V-1 for the vertices in a V-vertex graph.

The edges indicate a two-way relationship in that each edge can be traversed in both directions. 2 Directed graphs digraphs Set of objects with oriented pairwise connections. Weighted graph can store weights in list.

Given below is an example of a directed graph. The definition of Undirected Graphs is pretty simple. The main difference between directed and undirected graph is that a directed graph contains an ordered pair of vertices whereas an undirected graph contains an unordered pair of vertices.

The same graph can be represented as a directed graph if u remove each undirected edge and replace it with two directed edges in both directions between the same nodes. Two major components in a graph are. In this case uis the tail of the edge and vis the head.