This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. It does not offer a certificate upon completion.
Introduction to Digraphs
Loading...
Habilidades que você aprenderá
Graphs, Data Structure, Algorithms, Data Compression
Avaliações
4.9 (1,672 classificações)
16 de Abr de 2019
Amazing course! Loved the theory and exercises! Just a note for others: Its part 1 had almost no dependency on book, but this part 2 has some dependency (e.g. chapter on Graph) on book as well.
25 de Set de 2018
An incredible course that covers a lot of vital algorithm on graphs and strings. I learned a lot of new material that I hadn't known before. Thank you very much for this amazing course!
Na lição
Directed Graphs
In this lecture we study directed graphs. We begin with depth-first search and breadth-first search in digraphs and describe applications ranging from garbage collection to web crawling. Next, we introduce a depth-first search based algorithm for computing the topological order of an acyclic digraph. Finally, we implement the Kosaraju−Sharir algorithm for computing the strong components of a digraph.
Ministrado por
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Kevin Wayne
Phillip Y. Goldman '86 Senior Lecturer
Explore nosso catálogo
Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.
Coursera Footer
© 2022 Coursera Inc. Todos os direitos reservados.
