Skip to content

Commit a888447

Browse files
authored
Update README.md
1 parent 3369d7b commit a888447

File tree

1 file changed

+79
-1
lines changed

1 file changed

+79
-1
lines changed

README.md

Lines changed: 79 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1,79 @@
1-
# UF-Programming-Team
1+
# UF Programming Team
2+
3+
## Introduction
4+
5+
This repository contains notes that have been converted from slideshows I created in college for the UF Programming Team. I plan on adding notes for the more advanced topics I did not get to while at college. If you have any questions, requests, or find an error in the provided notes, please feel free to either open an issue or contact me at [email protected]
6+
7+
## Completed Notes
8+
9+
### Basics
10+
11+
- [Introduction to Problem Solving](./Notes/Problem-Solving.md)
12+
- [Data Structures](./Notes/Data-Structures.md)
13+
- [Bits and Subsets](./Notes/Bits-and-Subsets.md)
14+
- [Binary Search](./Notes/Binary-Search.md)
15+
16+
### Graph Theory
17+
18+
- [Introduction to Graph Theory](./Notes/Graph-Theory.md)
19+
- [Dijkstra's Algorithm](./Notes/Dijkstras-Algorithm.md)
20+
21+
### Dynamic Programming
22+
23+
- [Introduction to Dynamic Programming](./Notes/Dynamic-Programming.md)
24+
- [Bitmask Dynamic Programming](./Notes/Bitmask-Dynamic-Programming.md)
25+
26+
## Wish List
27+
28+
### Graph Theory
29+
30+
- Minimum Spanning Tree
31+
- Prim's Algorithm
32+
- Kruskal's Algorithm
33+
- Boruvka's Algorithm
34+
- All Pairs Shortest Path
35+
- Floyd Warshall Algorithm
36+
- Single Source Shortest Path
37+
- Bellman-Ford Algorithm
38+
- Heavy-Light Decomposition
39+
- Strongly Connected Components
40+
- Other
41+
- Vertex Cover
42+
- Edge Coloring
43+
- Euler Tour
44+
- Hamiltonian Cycle
45+
- Max Flow
46+
- Ford-Fulkerson Algorithm
47+
- Dinic's Algorithm
48+
- Push-Relabel Algorithm
49+
- Min-Cost Max-Flow
50+
- Maximum Bipartite Matching
51+
- Hungarian Algorithm
52+
53+
### Geometry
54+
55+
- Convex Hull
56+
- Rotating Calipers
57+
- Sweep Line
58+
59+
### Number Theory
60+
61+
- Sieve of Eratosthenes
62+
63+
### String Algorithms
64+
65+
- Knuth-Morris-Pratt Algorithm
66+
- Boyer-Moore Algorithm
67+
- Longest Common Substring/Subsequence
68+
- Shortest Common Superstring
69+
- Palindromes
70+
71+
### Data Structures
72+
73+
- String Data Structures
74+
- Suffix Tree/Array
75+
- Trie
76+
- Segment Trees
77+
- Binary Indexed Trees
78+
- Binary Search Trees
79+
- Kd Trees

0 commit comments

Comments
 (0)