Chevron Left
Volver a Graph Search, Shortest Paths, and Data Structures

Opiniones y comentarios de aprendices correspondientes a Graph Search, Shortest Paths, and Data Structures por parte de Universidad de Stanford

4.8
estrellas
1,894 calificaciones

Acerca del Curso

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)....

Principales reseñas

OK

30 de oct. de 2021

The course was very interesting. As a person who struggles with problem-solving, I found this course very helpful because the professor's ideas are well explained. It makes me to learn more.

DS

29 de mar. de 2020

Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.

Filtrar por:

201 - 225 de 225 revisiones para Graph Search, Shortest Paths, and Data Structures

por Garrett M

22 de may. de 2018

por Songmao L

3 de nov. de 2019

por Hao W

23 de mar. de 2021

por Joseph B

9 de ago. de 2018

por PLN R

17 de jun. de 2018

por Marko D

15 de ene. de 2020

por Manu A

9 de feb. de 2020

por Rudransh J

4 de may. de 2020

por Fan Y

1 de may. de 2018

por Utsav S

27 de jul. de 2020

por ALLA K R

15 de ene. de 2020

por Sandeep P

8 de sep. de 2018

por Toader A

6 de dic. de 2020

por Mohit S

28 de jun. de 2017

por Rakshit G

17 de dic. de 2016

por Christophe K

29 de dic. de 2020

por Nicolai V

21 de ago. de 2022

por Sudhanshu B

4 de mar. de 2020

por Michael B

7 de ago. de 2017

por Joern K

30 de ago. de 2018

por Nadanai L

30 de mar. de 2019

por Tianyi Z

16 de jul. de 2018

por Prasanna M R

5 de abr. de 2017

por Aditya A

29 de jul. de 2020