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:

101 - 125 de 225 revisiones para Graph Search, Shortest Paths, and Data Structures

por Frank J M

19 de sep. de 2019

por Manoj K

17 de jun. de 2020

por Albert P

13 de jul. de 2022

por Jonathan H

19 de may. de 2018

por Trong N

28 de jul. de 2017

por KengHwee

14 de ago. de 2020

por Jayana G

9 de ago. de 2021

por Anil K M

25 de dic. de 2017

por Yiming Z

26 de jul. de 2018

por Julius S

6 de jun. de 2017

por Pratik P

1 de sep. de 2019

por Tong L

16 de dic. de 2017

por Kozlov V

26 de jun. de 2020

por Jamie J S

3 de feb. de 2017

por Shisheng Z

19 de abr. de 2020

por Xiaohui X

7 de oct. de 2019

por Ethan

27 de jul. de 2020

por Yuxing C

1 de ene. de 2020

por Yuanzhan W

8 de may. de 2019

por Ian E

7 de may. de 2017

por Minsub L

13 de nov. de 2019

por Ankit A

8 de nov. de 2016

por Sani M

24 de nov. de 2019

por NG K H

13 de oct. de 2017

por Alexey Z

27 de ene. de 2020