Assertion: graph's edge | /r/HasProperty | directed
Facets:
Source sentences:
text: The edges can either be directed or undirected.
text: This latter type of graph is called a directed graph and the edges are called directed edges or arcs.
text: A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.
text: The edges can either be directed or undirected.
text: The edges may be directed or undirected.
text: Edges may be directed or undirected; undirected edges are also called lines and directed edges are also called arcs or arrows.
text: The edges may be directed or undirected.
text: Equivalently, a DAG is a directed graph that has a topological ordering, a sequence of the vertices such that every edge is directed from earlier to later in the sequence.
text: When the edges in a graph have a direction, the graph is called a directed graph or digraph, and the edges are called directed edges or arcs.
text: A directed walk is a finite or infinite sequence of edges directed in the same direction which joins a sequence of vertices.