Graph Search, Shortest Paths, and Data Structures
About this Course
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).Created by: Stanford University
Related Online Courses
Upon completion this course, learners will obtain the fundamental concepts and practical workings of OpenAI\'s Assistant APIs, enabling them to build intelligent, conversational agents faster than... more
This Specialization is about building an in-depth understanding of Batteries in Electric Vehicles Scenarios. The courses comprise topics such as Batteries and their types, applications,... more
This course is the last course in this specialization before its capstone experience where you, the learner will launch your business. Consider all the activities associated with the final... more
In today\'s rapidly evolving digital landscape, the importance of cybersecurity cannot be overstated. Threats to organizations, both large and small, are on the rise, and the consequences of... more
This course will introduce you to the attention mechanism, a powerful technique that allows neural networks to focus on specific parts of an input sequence. You will learn how attention works, and... more
Powered by
