Predecessor (graph theory)
From Wikipedia, the free encyclopedia
In graph theory, a vertex x in a directed graph is said to be a predecessor of a vertex y if there is a path from x to y. If there is an edge from x to y, then x is said to be a direct predecessor of y.
[edit] See also
 |
This article is uncategorized.
Please help improve this article by adding it to one or more categories, so it may be associated with related articles (how?). Please remove this tag after categorizing. |
