Assertion: graph | /r/HasProperty | directed
Facets:
Source sentences:
text: If the graph is directed, the direction is indicated by drawing an arrow.
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: In addition, graph properties can be classified according to the type of graph they describe: whether the graph is undirected or directed, whether the property applies to multigraphs, etc.
text: Graphs can either be directed or undirected based on whether the edges have orientations or not.
text: A graph G = (V, E) is directed if the edge set is composed of ordered vertex (node) pairs.
text: Graphs can be directed or undirected.
text: A graph can be directed or un-directed, as illustrated in the two examples below.
text: Graphs may be "directed" (traversal between nodes can happen only in one direction) or "undirected" (either direction may be traversed from node to node).
text: A graph may be either undirected or directed.