Mastering Algorithms With C - Kyle Loudon [247]
closed transport systems, Graph Algorithms
description of, Description of the Traveling-Salesman Problem
exchange heuristic, Related Topics
implementation and analysis of, Implementation and Analysis of the Traveling-Salesman Problem
interface for, Interface for the Traveling-Salesman Problem
minimum spanning tree approximation, Questions and Answers
nearest-neighbor heuristic, Applying the Nearest-Neighbor Heuristic
traversal methods, Trees, Traversal Methods, Preorder traversal, Inorder traversal, Postorder traversal, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing, Binary Tree Example: Expression Processing, Questions and Answers, Questions and Answers
expression trees, Binary Tree Example: Expression Processing
inorder traversal, Inorder traversal, Binary Tree Example: Expression Processing
postorder traversal, Postorder traversal, Binary Tree Example: Expression Processing, Questions and Answers
preorder traversal, Preorder traversal, Binary Tree Example: Expression Processing, Questions and Answers
recursive, Binary Tree Example: Expression Processing
trees, Trees, Trees, Trees, Trees, Trees, Trees, Description of Binary Trees, Traversal Methods, Description of Binary Search Trees, Questions and Answers, Questions and Answers, Related Topics, Related Topics, Related Topics, Related Topics, Related Topics, Related Topics, Heaps and Priority Queues, Description of Heaps
applications of, Trees
B*-, Related Topics
B+-, Questions and Answers, Related Topics
B-, Questions and Answers, Related Topics
balancing, Trees
binary, Trees, Description of Binary Trees
binary search, Trees, Description of Binary Search Trees
decision, Trees
k-ary, Related Topics
partially ordered, Description of Heaps
red-black, Related Topics
traversal of, Traversal Methods (see traversal methods)
tries, Related Topics
tsp function, tsp, Implementation and Analysis of the Traveling-Salesman Problem
TspVertex structure, Graph Algorithms, Implementation and Analysis of the Traveling-Salesman Problem
typedef, Implementation and Analysis of Stacks
U
undirected graphs, Description of Graphs
uniform hashing, Collision Resolution
union of sets, Return Value, set_union
universal hashing, Related Topics
unwinding phase, Basic Recursion
user interfaces, Trees
V
variables, Storage Allocation, Storage Allocation, Casts, Casts
automatic, Storage Allocation
casts, Casts
storage allocation, Storage Allocation
types, Casts
vector components, Related Topics
vectors, Computer Test for Intersecting Line Segments, Related Topics
Venn diagrams, Related Topics
vertices, Graphs, Description of Graphs
virtual addresses, Linked List Example: Frame Management
virtual memory, Linked List Example: Frame Management, Linked List Example: Frame Management, Circular List Example: Second-Chance Page Replacement
page-replacement algorithm, Circular List Example: Second-Chance Page Replacement
vs. physical memory, Linked List Example: Frame Management
virtual reality systems, Geometric Algorithms
void pointers, Generic Pointers
W
weak keys, Questions and Answers
weighted graphs, Graph Algorithms, Graph Algorithms
winding phase, Basic Recursion
wiring circuit boards, Graph Algorithms
worst-case analysis, Worst-Case Analysis
wrapper function, Questions and Answers
X
X Window System, Queue Example: Event Handling
About the Author
Kyle Loudon is a software engineer at Matrix Semiconductor in Santa Clara, California, where he works with file systems and applications for memory chips. Prior to Matrix, Kyle developed platform software