Assertion: graph's g | /r/HasProperty | v
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.