directed graph

directed graph

[də′rek·təd ′graf]
(mathematics)
A graph in which a direction is shown for every arc. Also known as digraph.

directed graph

(digraph) A graph with one-way edges.

See also directed acyclic graph.
References in periodicals archive ?
A faster algorithm for finding the minimum cut in a directed graph.
As demonstrated later in the paper, the study and application of the directed graph method is in line with the growing interest among econometricians and applied researchers in automated model discovery.
In a directed graph, or digraph, each direction is considered distinct and called a direct are or link.
We note that the graph, as defined here, is actually a directed graph.
A directed graph is a pair G := (E, [rho]) where [rho] is a binary relation on E.
Obviously, the time required to complete all jobs (makespan) is given by the length of the longest weighted path from the start vertex to the end vertex in a directed graph.
The sparsity structure of the inverse of a square, non-singular matrix is determined by the path structure of the directed graph of the matrix.
Construct a directed graph with at least 7 vertices and positive arc weights.
Essentially, a directed graph is an assignment of causal flows (or lack thereof) among a set of variables (vertices) based on observed correlations and partial correlations.
The directed graph approach was adopted to generate the bucking patterns by using the network analysis labeling algorithm.
The Quepasa internet crawler is designed with directed graph traversal capability to locate pages primarily relevant to the Hispanic community and is built around a powerful clustering platform that allows it to scale horizontally for any number of documents in any span of time, depending on hardware resources.

Full browser ?