• Algorithms, 4th edition
  • 1.  Fundamentals
    • 1.1  Programming Model
    • 1.2  Data Abstraction
    • 1.3  Stacks and Queues
    • 1.4  Analysis of Algorithms
    • 1.5  Case Study: Union-Find
  • 2.  Sorting
    • 2.1  Elementary Sorts
    • 2.2  Mergesort
    • 2.3  Quicksort
    • 2.4  Priority Queues
    • 2.5  Sorting Applications
  • 3.  Searching
    • 3.1  Symbol Tables
    • 3.2  Binary Search Trees
    • 3.3  Balanced Search Trees
    • 3.4  Hash Tables
    • 3.5  Searching Applications
  • 4.  Graphs
    • 4.1  Undirected Graphs
    • 4.2  Directed Graphs
    • 4.3  Minimum Spanning Trees
    • 4.4  Shortest Paths
  • 5.  Strings
    • 5.1  String Sorts
    • 5.2  Tries
    • 5.3  Substring Search
    • 5.4  Regular Expressions
    • 5.5  Data Compression
  • 6.  Context
    • 6.1  Event-Driven Simulation
    • 6.2  B-trees
    • 6.3  Suffix Arrays
    • 6.4  Maxflow
    • 6.5  Reductions
    • 6.6  Intractability
• Related Booksites
• Web Resources
• FAQ
• Data
• Code
• Errata
• References
• Online Course
• Lecture Slides
• Programming Assignments

6.   Context

This chapter under major construction.

Java programs in this chapter.

Below is a list of Java programs in this chapter. Click on the program name to access the Java code; click on the reference number for a brief description; read the textbook for a full discussion.

REF	PROGRAM	DESCRIPTION / JAVADOC
6.1	CollisionSystem.java	collision system
-	Particle.java	particle
6.2	BTree.java	B-tree
6.3	SuffixArray.java	suffix array
-	LRS.java	longest repeated substring
-	KWIK.java	keyword in context
6.4	FordFulkerson.java	max flow / min cut
-	FlowNetwork.java	capacitated network
-	FlowEdge.java	capacitated edge with flow
-	BipartiteMatching.java	bipartite matching
-	AssignmentProblem.java	weighted bipartite matching
-	Simplex.java	simplex method

Last modified on August 06, 2011.

Copyright © 2002–2013 Robert Sedgewick and Kevin Wayne. All rights reserved.