Programming, Graph Theory, Computer Science, Mathematics, Data Structures.
of the edges in a graph are directed, the graph is said to be a directed graph, also called digraph. If all of the edges in a graph are undirected, the graph is said to be — you guessed it — an undirected graph! Go figure, right? Directed graphs as compared to undirected graphs This is all very