Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D. Ullman, Stanford University, Stanford, California
Fundamentals of Data Structures,by Ellis Horowitz and Sartaj Sahni Data Structures, Algorithms and Program Style Using C,by James F. Korsh and Leonard J. Garrett Data Structures and Algorithm Analysis in C,by Mark Allen Weiss Data Structures: From A
1.Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni 2.Data Structures, Algorithms and Program Style Using C by James F. Korsh and Leonard J. Garrett 3.Data Structures and Algorithm Analysis in C by Mark Allen Weiss 4.Data Structures
Aho, Hopcroft , Ullman - Data Structures and Algorithms.1983.pdfAho, Hopcroft , Ullman - Data Structures and Algorithms.1983.pdfAho, Hopcroft , Ullman - Data Structures and Algorithms.1983.pdfAho, Hopcroft , Ullman - Data Structures and Algorithms.1
A n^2.5 algorithm for maximum matchings in bipartite graphs-[英文版, John E. Hopcroft & Richard M. Karp] A n^2.5 algorithm for maximum matchings in bipartite graphs-[中文版, John E. Hopcroft & Richard M. Karp] Hopcroft-Karp是计算二分图最大匹配的最快算法(根据《算法导论》第二版;但维基百