A graph where the relationship between the nodes in the graph has some sense of direction is called a directed graph. A directed graph is shown here:
Some examples of directed relationships are as follows:
Mike and his house (Mike lives in a house, but his house does not live in Mike).
John manages Paul (John is the manager of Paul).
Get 40 Algorithms Every Programmer Should Know now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now