Java Reference
In-Depth Information
J. E. Hopcroft and R. E. Tarjan, “Algorithm 447: Efficient Algorithms for
Graph Manipulation,”
Communications of the ACM
16
(1973), 372-378.
3.
A. B. Kahn, “Topological Sorting of Large Networks,”
Communications
of the ACM
5
(1962), 558-562.
4.
D. E. Knuth,
The Stanford GraphBase
, Addison-Wesley, Reading, MA,
1993.
5.
R. E. Tarjan,
Data Structures and Network Algorithms
, Society for Indus-
trial and Applied Mathematics, Philadelphia, PA, 1985.
6.
Search WWH ::
Custom Search