From 6ff8b0813a272b376f005a881d1714de41a2cfc6 Mon Sep 17 00:00:00 2001 From: YoSaucedo Date: Thu, 25 May 2017 18:21:42 -0500 Subject: [PATCH] Graphs --- translations/es/README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/translations/es/README.md b/translations/es/README.md index 0932575..21b8c9b 100644 --- a/translations/es/README.md +++ b/translations/es/README.md @@ -785,11 +785,11 @@ Escriba código en un pizarrón o en papel no en la computadora. Pruebe con algu - [ ] [Quicksort (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB) - [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB) -- [ ] Merge sort code: +- [ ] Codificando Merge sort: - [ ] [Using output array (C)](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c) - [ ] [Using output array (Python)](https://github.com/jwasham/practice-python/blob/master/merge_sort/merge_sort.py) - [ ] [In-place (C++)](https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc) -- [ ] Quick sort code: +- [ ] Codificando Quick sort: - [ ] [Implementation (C)](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) - [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c) - [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py) @@ -831,7 +831,7 @@ Los grafos pueden ser usados para representar muchos problemas en las Ciencias d - BFS and DFS – Conozca su complejidad computacional, sus tradeoffs y cómo implementarlos en código real - Cuando se le haga una pregunta busqué una solución basada en grafos, si no encuentra continúe. -- [ ] Skiena Lectures - great intro: +- [ ] Lecturas de Skiena – Gran introducción): - [ ] [CSE373 2012 - Lecture 11 - Graph Data Structures (video)](https://www.youtube.com/watch?v=OiXxhDrFruw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=11) - [ ] [CSE373 2012 - Lecture 12 - Breadth-First Search (video)](https://www.youtube.com/watch?v=g5vF8jscteo&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=12) - [ ] [CSE373 2012 - Lecture 13 - Graph Algorithms (video)](https://www.youtube.com/watch?v=S23W6eTcqdY&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=13) @@ -839,7 +839,7 @@ Los grafos pueden ser usados para representar muchos problemas en las Ciencias d - [ ] [CSE373 2012 - Lecture 15 - Graph Algorithms (con't 2) (video)](https://www.youtube.com/watch?v=ia1L30l7OIg&index=15&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) - [ ] [CSE373 2012 - Lecture 16 - Graph Algorithms (con't 3) (video)](https://www.youtube.com/watch?v=jgDOQq6iWy8&index=16&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -- [ ] Graphs (review and more): +- [ ] Grafos (revisión y más): - [ ] [6.006 Single-Source Shortest Paths Problem (video)](https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) - [ ] [6.006 Dijkstra (video)](https://www.youtube.com/watch?v=2E7MmKv0Y24&index=16&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) @@ -857,7 +857,7 @@ Los grafos pueden ser usados para representar muchos problemas en las Ciencias d - Curso Completo de Coursera: - [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome) -- I'll implement: +- Implementaré: - [ ] DFS with adjacency list (recursive) - [ ] DFS with adjacency list (iterative with stack) - [ ] DFS with adjacency matrix (recursive)