Assertion: directed graph | /r/Synonym | oriented graph
Facets:
value: oppositely
type: MANNER
Source sentences:
text: A directed graph is called an oriented graph if none of its pairs of vertices is linked by two symmetric edges.
text: A directed graph is strongly connected if there are oppositely oriented directed paths containing each pair of vertices.