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

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 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.

Filtrar por:

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

por sysucx

24 de jan de 2017

por Yifeng L

23 de nov de 2018

por yangyunlong

7 de fev de 2020

por Ning K

26 de jan de 2019

por Rickard A

30 de jun de 2020

por Chaozhe H

4 de mar de 2021

por Владимир К

3 de nov de 2017

por Prince C S

9 de set de 2021

por Feiyu L

25 de abr de 2018

por Hrithwik S

8 de abr de 2020

por liping l

29 de mai de 2017

por Muskan K

9 de fev de 2020

por josh c

28 de mai de 2020

por Peter C

19 de mar de 2018

por Alvaro J P F

23 de jan de 2017

por haifang z

3 de jan de 2017

por Kevin H

29 de out de 2020

por Chi M

17 de set de 2018

por vacous

29 de dez de 2017

por badrinath r

21 de nov de 2017

por Peregrine D

14 de nov de 2019

por Minyue D

24 de mai de 2017

por shivaranjani g

17 de jun de 2021

por David D

24 de ago de 2020

por Aishwarya R

17 de jul de 2019