December 02, 2019
Amitraj
Directed Graph
If a graph contains ordered pair of vertices, is said to be a Directed Graph.
If an edge is represented using a pair of vertices (V1, V2), the edge is said to be directed from V1 to V2.
The first element of the pair V1 is called the start vertex and the second element of the pair V2 is called the end vertex.
Set of Vertices V = {1, 2, 3, 4, 5, 5}
Set of Edges W = {(1, 3), (1, 5), (2, 1), (2, 3), (2, 4), (3, 4), (4, 5)}
Undirected Graph
-> If a graph contains unordered pair of vertices, is said to be an Undirected Graph.
-> In this graph, pair of vertices represents the same edge.
Set of Vertices V = {1, 2, 3, 4, 5}
Set of Edges E= {(1, 2), (1, 3), (1, 5), (2, 1), (2, 3), (2, 4), (3, 4), (4, 5)}
-> In an undirected graph, the nodes are connected by undirected arcs.
-> It is an edge that has no arrow. Both the ends of an undirected arc are equivalent, there is no head or tail.
If a graph contains ordered pair of vertices, is said to be a Directed Graph.
If an edge is represented using a pair of vertices (V1, V2), the edge is said to be directed from V1 to V2.
The first element of the pair V1 is called the start vertex and the second element of the pair V2 is called the end vertex.
Set of Vertices V = {1, 2, 3, 4, 5, 5}
Set of Edges W = {(1, 3), (1, 5), (2, 1), (2, 3), (2, 4), (3, 4), (4, 5)}
Undirected Graph
-> If a graph contains unordered pair of vertices, is said to be an Undirected Graph.
-> In this graph, pair of vertices represents the same edge.
Set of Vertices V = {1, 2, 3, 4, 5}
Set of Edges E= {(1, 2), (1, 3), (1, 5), (2, 1), (2, 3), (2, 4), (3, 4), (4, 5)}
-> It is an edge that has no arrow. Both the ends of an undirected arc are equivalent, there is no head or tail.
