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:

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

por Jithu K

27 de nov. de 2021

por Constantinos F

30 de abr. de 2017

por Long N

16 de ene. de 2021

por YEH T P

26 de feb. de 2018

por Nicolas T

28 de mar. de 2019

por Anton B

30 de nov. de 2018

por Sviatoslav S

31 de dic. de 2016

por Akash K B

24 de may. de 2020

por Dinghan X

10 de dic. de 2019

por Okhunjon K

31 de oct. de 2021

por derek S

29 de mar. de 2020

por Tarit G

1 de dic. de 2019

por Shaun G

2 de ago. de 2021

por Hanyu C

12 de nov. de 2017

por Oleksandr S

4 de ago. de 2019

por Axel U

11 de dic. de 2020

por ahmed a

9 de abr. de 2020

por Jephte E

27 de dic. de 2019

por Karan S

1 de sep. de 2018

por Mariia B

9 de jun. de 2021

por Anthony C

2 de ago. de 2020

por Cole F

21 de ene. de 2018

por Keerthana S

12 de jul. de 2018

por Genyu Z

9 de feb. de 2019