Main Page
From VT.Prog
Welcome to the Virginia Tech Programming Team wiki. The VT Programming Team meets weekly to practice for regional and international programming competitions. Competitions involve teams of three that compete to solve the most programming problems in the least amount of time. This wiki serves as a resource for members and those who are interested in joining the programming team.
Contents |
General
Contests
Tricks
References
Algorithms
While this is intended to be useful in its own right, in the meantime, feel free to visit this and knock yourself out.
Graph Theory
- Tree
- A-Star
- Dijkstra's
- Euler's Path
- Flow
- Floyd-Warshall's
- Kruskal's Minimum Spanning Tree
- Prim's Minimum Spanning Tree
- Maximal Matching
- Dynamic Programming
Number Theory
