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:

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

por monkfish

24 de jun. de 2018

por Madhurya m

13 de sep. de 2019

por Clayton W

2 de feb. de 2019

por Felice F

31 de ago. de 2020

por Neo

13 de may. de 2019

por goldkeytom

2 de ene. de 2018

por ryan

25 de sep. de 2017

por Yisheng Y

1 de dic. de 2016

por Ahmad e D

8 de nov. de 2020

por Jingyuan W

13 de nov. de 2019

por dynasty919

20 de feb. de 2018

por 최정식

3 de oct. de 2021

por Sergey T

30 de may. de 2020

por Christopher E

21 de sep. de 2019

por Gonzalo G A E

21 de abr. de 2020

por Sivaramakrishnan S

11 de may. de 2020

por Ahmad B E

2 de jun. de 2017

por Li-Pu C

27 de may. de 2020

por Bianca D

23 de feb. de 2019

por Jingxuan W

24 de ago. de 2019

por Nikola G

25 de jul. de 2018

por Marcus H

19 de oct. de 2017

por Georgios K

29 de dic. de 2019

por Sai R

11 de dic. de 2016

por L H

2 de mar. de 2021