Directed Graph Vs Undirected Graph

Directed Graph	Undirected Graph
A directed graph is a graph in which the edges in the graph that link the vertices have a direction.	An undirected graph is a graph in which there is no direction in the edges that link the vertices in the graph.
Edges in directed graph are ordered pairs.	Edges in an undirected graph are not ordered pairs.
In-degree and out-degree of each node in directed graph may or may not be equal.	In-degree and out-degree of each node in an undirected graph is equal.
A directed graph cannot be converted to undirected graph.	An undirected graph can be converted to directed graph.
If directed graph is represented by a matrix we may or may not get symmetric matrix.	If undirected graph is represented by a matrix we always get a symmetric matrix.
Example:	Example: