Chevron Left
Voltar para Graph Search, Shortest Paths, and Data Structures

Comentários e feedback de alunos de Graph Search, Shortest Paths, and Data Structures da instituição Universidade de Stanford

4.8
estrelas
1,894 classificações

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

Melhores avaliações

OK

30 de out 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:

51 — 75 de 225 Avaliações para o Graph Search, Shortest Paths, and Data Structures

por Vladimir M

2 de jan de 2021

por Linh T

9 de dez de 2019

por Neil S

28 de jun de 2019

por Qinghua Z

30 de ago de 2017

por Stacy I

1 de jun de 2019

por Mikhail K

27 de nov de 2018

por Johnathan F

14 de jan de 2018

por Grigory G

26 de nov de 2017

por NoneLand

18 de abr de 2018

por Neeladree C

30 de jun de 2017

por Dilyan M

16 de dez de 2017

por Garrett S

15 de dez de 2018

por Anway A

9 de jul de 2020

por Turker C

6 de jul de 2020

por navin m

29 de nov de 2020

por Fernando L C

16 de abr de 2018

por Krish R

16 de mai de 2018

por Arjun B

31 de jul de 2020

por Nicolae S A

14 de dez de 2016

por Alexey D

29 de nov de 2016

por Brande G

3 de jul de 2018

por Kalema A B

28 de nov de 2020

por Johan B

3 de set de 2017

por Vishwas S

22 de jun de 2020

por Jianhui S

21 de out de 2018