Directed Acyclic Graphs

Formats Non-Member Member
$15 $15
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, books, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

This chapter contains sections titled: Directed acyclic graphs, Topological sorting, How to represent a directed graph, Running time of topological sorting, Critical path in a PERT chart, Shortest path in a directed acyclic graph, Further reading