Digraph Sink

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called a sink) is a node in a directed graph which is reached by all directed edges (Harary 1994, p. 201; right figure).

REFERENCES

Borowski, E. J. and Borwein, J. M. (Eds.). The HarperCollins Dictionary of Mathematics. New York: HarperCollins, 1991.

Cormen, T. H.; Leiserson, C. E.l and Rivest, R. L. Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.