Descripción de “Graph Search, Shortest Paths, and Data Structures (Coursera)”
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Añadido a tus favoritosEliminado de tus favoritos0
Añadir para comparar
Este sitio web utiliza cookies para un correcto funcionamiento. Si continúas navegando estás dando tu consentimiento para estas cookies y aceptas nuestra política de cookies, clic para más información.
Aún no hay reseñas.