Explore: Directed Graphs

Weighted directed graphs (also known as directed networks) are (simple) directed graphs with weights assigned to their arrows, similarly to weighted graphs (which

graphs representing the same partial order have the same set of topological orders. The graph enumeration problem of counting directed acyclic graphs

In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is

Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the

vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which

align directed/undirected graphs. GraphBLAS A specification for a library interface for operations on graphs, with a particular focus on sparse graphs.

this graph is directed, because owing money is not necessarily reciprocated. Graphs are the basic subject studied by graph theory. The word "graph" was

feedback vertex set. A directed cycle graph has uniform in-degree 1 and uniform out-degree 1. Directed cycle graphs are Cayley graphs for cyclic groups (see

which handled only directed acyclic graphs. At its simplest, DOT can be used to describe an undirected graph. An undirected graph shows simple relations

combinatorics, in the area of random graphs. These graphs are also called multiply rooted graphs. The terms rooted directed graph or rooted digraph also see variation