Definition
In mathematics, and more specifically in graph theory, a directed graph is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
Related concepts
Adjacency matrixBidirected graphBinary relationBranching factorCategory theoryCoates graphCommutative diagramComplete graphConnectivity (graph theory)Control-flow graphDGMLDRAKONDigraph realization problemDirected acyclic graphDirected cycleDirected multigraphEdge (graph theory)Element (mathematics)Field (mathematics)Finite-state machineFlow chartFlow graph (mathematics)Flow networkFrank HararyFree categoryFulkerson–Chen–Anstee theoremFunctorFunctor categoryGlobular setGlossary of graph theoryGraph (abstract data type)Graph (discrete mathematics)Graph Style SheetsGraph databaseGraph theoryIncidence matrixIntegerJohn Adrian BondyKleitman–Wang algorithmLie groupLinear mapLogical matrixLoop (graph theory)MathematicsMatrix (mathematics)MultisetMultitreeNatural transformationNetwork theoryOn-Line Encyclopedia of Integer SequencesOrdered pairOrientation (graph theory)Oriented graphOriented treePath (graph theory)PreorderQuiver (mathematics)Reinhard DiestelRooted graphRooted treeSet (mathematics)Signal-flow graphSpringer International Publishing AGSpringer Science+Business MediaState diagramStrongly connectedTopological sortingTournament (mathematics)Transpose graphU. S. R. MurtyUndirected graphUnordered pairVector spaceVertex (graph theory)Vertical constraint graphWeighted graphWeighted networkZero-weight cycle problem
12 concepts already in your glossary