| 이름 |
설명 |
| BigStringSearch |
Team 8 - Rod Howarth n6294685 |
| ChannelAllocation |
Rod Howarth - n6294685 Team14 |
| ChannelAllocation.Node |
|
| Crank |
Rod Howarth - n6294685 Team14 |
| Crank.Building |
|
| DNAMatcher |
Rod Howarth - n6294685 Team14 |
| DNAMatcher.SuffixTree |
|
| DNAMatcher.TreeNode |
Represents a treenode in the suffix tree |
| DiagonalShorcuts |
Rod Howarth - n6294685 Team14 |
| GraphTraversal |
Rod Howarth - n6294685 Team14 |
| KnapSack |
Rod Howarth - n6294685 Team14 |
| LineSegmentTurning |
Rod Howarth - n6294685 Team14 |
| LineSegmentTurning.Corner |
|
| LineSegmentTurning.Point |
|
| MaximumCardinalityBipartiteMatching |
Rod Howarth - n6294685 Team14 |
| MaximumCardinalityBipartiteMatching.Node |
|
| MaximumFlow |
Rod Howarth - n6294685 Team14 |
| Money |
Rod Howarth - n6294685 Team14 |
| NRooks |
Rod Howarth - n6294685 Team14 Calculates permutations of how many rooks can be on a chess board without being able to hit each other. |
| NextPermutation |
Rod Howarth - n6294685 Team14 |
| Spreadsheet |
Rod Howarth - n6294685 Team14 |
| Spreadsheet.Node |
|
| StableMarriage2 |
Rod Howarth - n6294685 Team14 |
| StableMarriage2.Person |
|
| Taxi |
Rod Howarth - n6294685 Team14 |
| Taxi.Node |
|
| Template |
Rod Howarth - n6294685 Team14 |
| WheresWaldorf |
Wheres Waldorf homework problem - Rod Howarth n6294685 |