Assertion: graph's edge | /r/MadeOf | ordered vertex pair
Facets:
Source sentences:
text: A graph $G = (V, E)$ is called a directed graph if the edge set is made of ordered vertex pair and a graph is called undirected if the edge set is made of unordered vertex pair.
text: A graph $G = (V, E)$ is called a directed graph if the edge set is made of ordered vertex pair and a graph is called undirected if the edge set is made of unordered vertex pair.
text: A graph is undirected if the edge set is composed of unordered vertex pair.
text: A graph G = (V, E) is directed if the edge set is composed of ordered vertex (node) pairs.