Skip to content

Fix "Kruskal's" in schedule #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion slides/index.html
Original file line number Diff line number Diff line change
Expand Up @@ -165,7 +165,7 @@ <h2 id="schedule-and-slides"><a name="introduction"></a>Schedule and Slides</h2>
<tr class="even">
<td></td>
<td>Wed. Mar. 3</td>
<td>Krukal’s Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4)</td>
<td>Kruskal’s Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4)</td>
<td><a href="./kruskal-find-union.pptx">ppt</a>, <a href="./kruskal-find-union.pdf">pdf</a></td>
<td></td>
<td></td>
Expand Down
2 changes: 1 addition & 1 deletion slides/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ CS4102 - Algorithms
| | Wed. Feb. 24 | Heap Sort, Strassen's algorithm <br/> (CLRS Ch. 6 & 4.2) |[pptx](./heapsort_strassen.pptx), [pdf](./heapsort_strassen.pdf) | | Module 1 HW Soft Deadline | Written Recurrence Relations (Recommended) |
| | Fri. Feb. 26 | | | | | |
| Graphs | Mon. Mar. 1 | Review of Graphs, BFS <br/> (CLRS Ch. 22.1-22.2) | [ppt](./graphs-BFS-recorded.pptx), [pdf](./graphs-BFS-recorded.pdf), [live](./graphs-BFS-live.pptx) | | | |
| | Wed. Mar. 3 | Krukal's Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4) | [ppt](./kruskal-find-union.pptx), [pdf](./kruskal-find-union.pdf) | | | 1 Module one advanced HW (Recommended) |
| | Wed. Mar. 3 | Kruskal's Algo, Find-Union <br/> (CLRS ch. 23.2 and 21.1-21.4) | [ppt](./kruskal-find-union.pptx), [pdf](./kruskal-find-union.pdf) | | | 1 Module one advanced HW (Recommended) |
| | Fri. Mar. 5 | | | Quiz 1 | | |
| | Mon. Mar. 8 | Depth-First Search <br/> (CLRS 22.3) | [pptx](./graphs-dfs.pptx), [pdf](./graphs-dfs.pdf) | | | |
| | Wed. Mar. 10 | Topological Sorting and Strongly Connected Components <br/> (CLRS 22.4 & 22.5) | [pptx](./graphs-topoSort-connComponents.pptx), [pdf](./graphs-topoSort-connComponents.pdf)| | Module 1 HW Hard Deadline | Graphs Written (Recommended) |
Expand Down