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

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:

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

por Divij S

23 de feb. de 2018

por Krishna K

1 de jul. de 2019

por Jayachandra B A

16 de oct. de 2018

por Hoang N

30 de jul. de 2017

por Chris S

13 de abr. de 2018

por Shiv K

22 de jul. de 2017

por Alexander L

11 de nov. de 2019

por Victor C

28 de may. de 2017

por Mario R

7 de ago. de 2019

por Danijel P

30 de jul. de 2018

por Ovidiu F

16 de oct. de 2021

por Ziyan H

4 de sep. de 2017

por Anurag G

17 de jul. de 2018

por Nikhil n

21 de jul. de 2017

por Brian C

26 de mar. de 2017

por Benoit P

29 de dic. de 2016

por --

11 de abr. de 2021

por Piyush S

13 de abr. de 2018

por Jonathan M

6 de may. de 2020

por Hagen T

19 de mar. de 2018

por Aria B

21 de abr. de 2020

por Anthony J O

3 de may. de 2017

por Joshua S

2 de nov. de 2018

por Damian C

17 de feb. de 2018

por John W

13 de ago. de 2017