Difference between revisions of "Code Archive"
From Ubcacm
| Line 1: | Line 1: | ||
| + | * [[CodeArchive 3DGeometry|3D Gemoetry]] | ||
| + | * [[CodeArchive AllPairMinCut|All Pair Minimum Cut]] | ||
* [[CodeArchive BPTShort|Bipartite Matching]] | * [[CodeArchive BPTShort|Bipartite Matching]] | ||
| + | * [[CodeArchive BigIntSqrt|Big Integer Square Root]] | ||
| + | * [[CodeArchive BinaryIndxedTree|Binary Indexed Tree]] | ||
| + | * [[CodeArchive ChineseRemainderTheorem|Chinese Remainder Theorem]] | ||
| + | * [[CodeArchive CircleBoundaryTraveral|Circle Boundary Traversal]] | ||
| + | * [[CodeArchive EulerCircuit|Euler Circuit]] | ||
| + | * [[CodeArchive ExpressionEvaluation|Expression Evaluation (Parsing)]] | ||
| + | * [[CodeArchive ExtendedGCD|Extended GCD]] | ||
| + | * [[CodeArchive Geometry|Geometry]] | ||
| + | * [[CodeArchive Geometry3D|Geometry 3D (Yury's version)]] | ||
| + | * [[CodeArchive LinearAlgebra|Linear Algebra]] | ||
| + | * [[CodeArchive Matching|General Graph Matching]] | ||
| + | * [[CodeArchive MaximumFlowShort|Maximum Flow (Short Versions)]] | ||
| + | * [[CodeArchive MinCostMaxFlow|Minimum Cost Maximum Flow]] | ||
| + | * [[CodeArchive MinEnclosingSphere|Minimum Enclosing Sphere]] | ||
| + | * [[CodeArchive NQueue|N Queue problem]] | ||
| + | * [[CodeArchive Simplex|Simplex]] | ||
| + | * [[CodeArchive SuffixTree|Suffix Tree]] | ||
Revision as of 22:16, 29 January 2007
- 3D Gemoetry
- All Pair Minimum Cut
- Bipartite Matching
- Big Integer Square Root
- Binary Indexed Tree
- Chinese Remainder Theorem
- Circle Boundary Traversal
- Euler Circuit
- Expression Evaluation (Parsing)
- Extended GCD
- Geometry
- Geometry 3D (Yury's version)
- Linear Algebra
- General Graph Matching
- Maximum Flow (Short Versions)
- Minimum Cost Maximum Flow
- Minimum Enclosing Sphere
- N Queue problem
- Simplex
- Suffix Tree
