directed graph
A simple directed graph.
Noun
- A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
Modern English dictionary
Explore and search massive catalog of over 900,000 word meanings.
Word of the Day
Get a curated memorable word every day.
Challenge yourself
Level up your vocabulary by setting personal goals.
And much more
Try out Vedaist now.