What is a directed graph in discrete mathematics?

Answer 1

A directed graph in discrete mathematics, usually refered to as graph theory, is a collection of nodes that represent information/data, connected together by edges, where the edges are directed as going from one node to another rathen than being a simple link.

For example the road network could be depicted as a complex network, and the vast majority of edges (depicting roads) would not be directed, excluding one way streets, due to roads going in both directions.

Whereas the water network running through a city or county or whatever you choose, would be depicted as a directed network as the water can only flow in one direction. Also, sometimes in cases such as these you will get directed magnitude graphs where the directed edges specify the direction of flow and the numbers attributed to each edge show the maximum capacity through that edge/pipe.