This is a demo web service of visualization of various data structures and algorithms listed in "Competitive Programming 2" book.
This website is a property of School of Computing, National University of Singapore.
This project is funded by NUS Centre for Development Teaching and Learning (CDTL).
This work will be presented to worldwide audience during ACM ICPC World Finals 2012 (Poland, Warsaw) and IOI 2012 (Sirmione-Montichiari, Italy).
Note that this web service is not 100% ready yet!
This semester, this web service is currently on trial for several SoC, NUS modules (CS3233, CS2020, CS2010, and a few other modules).
| In CP2 | Data Structures and/or Algorithms | Used in these NUS SoC Modules | Developer | Status |
|---|---|---|---|---|
| Page 23-24 | Bitmask | CS3233, Lecture 2 CS2010, Lecture 10 CS2020 |
Steven | Updated 11 Apr 2012 |
| 26 | Binary Search Tree (ADT Table) |
CS2010, Lecture 2 and 3 CS2020 |
Steven | Not yet started |
| 27 | Binary Heap (ADT Priority Queue) |
CS2010, Lecture 4 CS2020, Lecture 9 |
Steven | Updated 10 Feb 2012 |
| 29-30 | Graph Data Structures | CS3233, Lecture 5 CS2010, Lecture 5 CS2020 |
Zi Chun | Updated 27 Feb 2012 |
| 30-32 | Union-Find Disjoint Sets (UFDS) |
CS3233, Lecture 2 (briefly) CS2010, Lecture 6 CS2020 |
Steven | Not yet started High priority |
| 32-35 | Segment Tree | CS3233, Lecture 2 (briefly) | Steven | Not yet started High priority |
| 35-37 | Binary Indexed (Fenwick) Tree | CS3233, Lecture 2 | Steven | Updated 25 Jan 2012 |
40-41 | n-Queens Recursive Backtracking | CS3233, Lecture 3 | N/A | Not yet started |
| 55-68 | Classical DP Animations? | CS3233, Lecture 4 and 6 | N/A | Not yet started |
| 71-83 | Graph Traversal Breadth & Depth-First Search |
CS3233, Lecture 5 CS2010, Lecture 5 CS2020 |
Zi Chun | Updated 27 Feb 2012 |
| 84-89 | Minimum Spanning Tree (MST) Prim's & Kruskal's |
CS3233, Lecture 5 (briefly) CS2010, Lecture 6 CS2020 CS1231? |
Zi Chun | Updated 27 Feb 2012 |
| 90-95 | Single-Source Shortest Paths (SSSP) Dijkstra's & Bellman Ford's |
CS3233, Lecture 5 CS2010 Lecture 7 and 8 CS2020 |
Zi Chun | Updated 07 Feb 2012 |
| 96-100 | All-Pairs Shortest Paths (APSP) Floyd Warshall's |
CS3233, Lecture 5 CS2010, Lecture 12 CS2020 |
N/A | Not yet started |
| 101-107 | Maximum Flow Edmonds Karp's |
CS3233, Lecture 8 | Zi Chun Felix |
Released 29 Feb 2012 |
| 107-112 | Algorithms on DAG | CS3233, Lecture 6 CS2010, Lecture 9 and 10 CS2020 |
N/A | Not yet started |
| 112-113 | Algorithms on Tree | CS3233, Lecture 5 | N/A | Not yet started |
| 114-118 | Algorithms on Bipartite Graph | CS3233, Lecture 8 | N/A | Not yet started |
| 156-158 | String Matching Knuth-Morris-Pratt's |
CS3233, Lecture 10 | N/A | Not yet started |
| 160-162 | String Alignment (Edit Distance) Longest Common Subsequence |
CS3233, Lecture 10 | N/A | Not yet started |
| 163-173 | Suffix Tree and Suffix Array | CS3233, Lecture 10 | Felix 1? or 2? |
Not yet started High priority |
| 188-194 | Algorithms on Polygon Convex Hull (Graham's Scan) isConvex() |
CS3233, Lecture 11 | Victor | In progress 5 Dec 2011 |
| 203-204 | A*/IDA*/Meet in the Middle | CS3233, Lecture 12 | Victor | Not yet started |
A total of 470 different hosts have accessed this document in the last 111 days; your host, 38.107.179.218, has accessed it 1 times.
If you're interested, complete statistics for this document are also available, including breakdowns by top-level domain, host name, and date.