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,918 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

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.

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.

Filtrar por:

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

por Jerome Z

29 de oct. de 2018

por Yifan Z

8 de feb. de 2018

por Bogdan K

28 de jun. de 2017

por Carlos W C Y

12 de abr. de 2022

por Manol D

12 de feb. de 2020

por Fesri H

2 de ene. de 2020

por Ashish S

6 de ago. de 2018

por Luiz C

19 de mar. de 2018

por 20-IT-036 C S

30 de abr. de 2022

por Sui X

5 de jun. de 2019

por Bastin J

28 de may. de 2018

por Deleted A

15 de oct. de 2017

por Khan M A

16 de jul. de 2017

por luketerry

13 de jul. de 2017

por Pruthvi K

28 de may. de 2022

por AKLI J E Y

11 de jun. de 2021

por Haixu L

7 de jun. de 2020

por 秦天

12 de jun. de 2019

por Karim E

15 de ene. de 2018

por Ajit B

31 de ago. de 2020

por Rishabh K

11 de ene. de 2018

por Stephen R

6 de jul. de 2022

por Ryan S

28 de jun. de 2017

por Saurav M

22 de mar. de 2019

por Maxim M

8 de dic. de 2019