code fragments.mht

经典的数据结构源代码（java 实现）

  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/EulerTour-Eu=
lerTour.html">7.29=20
  EulerTour-EulerTour</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/ExpressionTe=
rm-ExpressionTerm.html">7.30=20
  ExpressionTerm-ExpressionTerm</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/ExpressionVa=
riable-ExpressionVariable.html">7.30=20
  ExpressionVariable-ExpressionVariable</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/ExpressionOp=
erator-ExpressionOperator.html">7.30=20
  ExpressionOperator-ExpressionOperator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/AdditionOper=
ator-AdditionOperator.html">7.30=20
  AdditionOperator-AdditionOperator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/EvaluateExpr=
essionTour-EvaluateExpressionTour.html">7.31=20
  EvaluateExpressionTour-EvaluateExpressionTour</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/PrintExpress=
ionTour-PrintExpressionTour.html">7.32=20
  PrintExpressionTour-PrintExpressionTour</A></LI></UL>
<H3>Chapter 8: Priority Queues</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/Entry-Entry.=
html">8.1=20
  Entry-Entry</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/Lexicographi=
c-Lexicographic.html">8.2=20
  Lexicographic-Lexicographic</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/Point2D-Poin=
t2D.html">8.3=20
  Point2D-Point2D</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/PriorityQueu=
e-PriorityQueue.html">8.4=20
  PriorityQueue-PriorityQueue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/SortedListPr=
iorityQueue-SortedListPriorityQueue1.html">8.6=20
  SortedListPriorityQueue-SortedListPriorityQueue1</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/DefaultCompa=
rator-DefaultComparator.html">8.7=20
  DefaultComparator-DefaultComparator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/SortedListPr=
iorityQueue-SortedListPriorityQueue2.html">8.8=20
  SortedListPriorityQueue-SortedListPriorityQueue2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/CompleteBina=
ryTree-HeapTree.html">8.9=20
  CompleteBinaryTree-HeapTree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/ArrayListCom=
pleteBinaryTree-VectorHeap.html">8.10=20
  ArrayListCompleteBinaryTree-VectorHeap</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/ArrayListCom=
pleteBinaryTree-VectorHeap2.html">8.11=20
  ArrayListCompleteBinaryTree-VectorHeap2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/ArrayListCom=
pleteBinaryTree-VectorHeap3.html">8.12=20
  ArrayListCompleteBinaryTree-VectorHeap3</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/HeapPriority=
Queue-HeapPriorityQueue.html">8.13=20
  HeapPriorityQueue-HeapPriorityQueue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/HeapPriority=
Queue-mainMethods.html">8.14=20
  HeapPriorityQueue-mainMethods</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/HeapPriority=
Queue-auxiliary.html">8.15=20
  HeapPriorityQueue-auxiliary</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/SortedListAd=
aptablePriorityQueue-SortedListAdaptablePriorityQueue.html">8.17=20
  SortedListAdaptablePriorityQueue-SortedListAdaptablePriorityQueue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch07/Java/SortedListAd=
aptablePriorityQueue-LocationAwareEntry.html">8.18=20
  SortedListAdaptablePriorityQueue-LocationAwareEntry</A></LI></UL>
<H3>Chapter 9: Maps and Dictionaries</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/HashCode-Lon=
g.html">9.2=20
  HashCode-Long</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/HashCode-Str=
ing.html">9.2=20
  HashCode-String</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/HashTableMap=
-Header.html">9.3=20
  HashTableMap-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/HashTableMap=
-Linear.html">9.4=20
  HashTableMap-Linear</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/HashTableMap=
-Linear2.html">9.5=20
  HashTableMap-Linear2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch08/Java/WordCount-wo=
rds.html">9.6=20
  WordCount-words</A></LI></UL>
<H3>Chapter 10: Search Trees</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/BinarySearch=
Tree-BinarySearchTree.html">10.3=20
  BinarySearchTree-BinarySearchTree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/BinarySearch=
Tree-BinarySearchTree2.html">10.4=20
  BinarySearchTree-BinarySearchTree2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/BinarySearch=
Tree-BinarySearchTree3.html">10.5=20
  BinarySearchTree-BinarySearchTree3</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/AVLTree-AVLT=
ree.html">10.7=20
  AVLTree-AVLTree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/AVLTree-AVLT=
ree2.html">10.8=20
  AVLTree-AVLTree2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/RBTree-RBTre=
e.html">10.9=20
  RBTree-RBTree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/RBTree-inser=
tItem.html">10.10=20
  RBTree-insertItem</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch09/Java/RBTree-remed=
yDoubleBlack.html">10.11=20
  RBTree-remedyDoubleBlack</A></LI></UL>
<H3>Chapter 11: Sorting, Sets, and Selection</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Sort-mergeSo=
rt.html">11.3=20
  Sort-mergeSort</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Sort-merge.h=
tml">11.3=20
  Sort-merge</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Sort-mergeSo=
rt2.html">11.4=20
  Sort-mergeSort2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Sort-quickSo=
rt.html">11.7=20
  Sort-quickSort</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Sort-quickSo=
rtStep.html">11.7=20
  Sort-quickSortStep</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/Merge-Merger=
.html">11.9=20
  Merge-Merger</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/UnionMerge-U=
nionMerger.html">11.10=20
  UnionMerge-UnionMerger</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/IntersectMer=
ge-IntersectMerger.html">11.10=20
  IntersectMerge-IntersectMerger</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch10/Java/SubtractMerg=
e-SubtractMerger.html">11.10=20
  SubtractMerge-SubtractMerger</A></LI></UL>
<H3>Chapter 12: Text Processing</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch11/Java/PatternMatch=
ing-BMmatch.html">12.3=20
  PatternMatching-BMmatch</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch11/Java/PatternMatch=
ing-KMPmatch.html">12.6=20
  PatternMatching-KMPmatch</A></LI></UL>
<H3>Chapter 13: Graphs</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DecorablePos=
ition-Decorable.html">13.2=20
  DecorablePosition-Decorable</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DFS-DFS.html=
">13.4=20
  DFS-DFS</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DFS-decorati=
ons.html">13.4=20
  DFS-decorations</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DFS-auxiliar=
y.html">13.4=20
  DFS-auxiliary</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DFS-DFS2.htm=
l">13.5=20
  DFS-DFS2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/DFS-Tail.htm=
l">13.5=20
  DFS-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/Connectivity=
DFS-ConnectivityTesterDFS.html">13.6=20
  ConnectivityDFS-ConnectivityTesterDFS</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/ComponentsDF=
S-CC.html">13.7=20
  ComponentsDFS-CC</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/FindPathDFS-=
FindPathDFS.html">13.8=20
  FindPathDFS-FindPathDFS</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/FindCycleDFS=
-FindCycleDFS.html">13.9=20
  FindCycleDFS-FindCycleDFS</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/Dijkstra-exe=
cute.html">13.15=20
  Dijkstra-execute</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch12/Java/Dijkstra-dij=
kstraVisit.html">13.16=20
  Dijkstra-dijkstraVisit</A></LI></UL>
<H3>Chapter 14: Memory</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch14/Java/StackExample=
s-factorial.html">14.1=20
  StackExamples-factorial</A></LI></UL></BODY></HTML>

------=_NextPart_000_0000_01C82C3C.7D87F0A0
Content-Type: text/css;
	charset="gb2312"
Content-Transfer-Encoding: quoted-printable
Content-Location: http://ww0.java4.datastructures.net/style.css

H1 {
	FONT-WEIGHT: bold; FONT-FAMILY: Helvetica
}
H2 {
	FONT-WEIGHT: bold; FONT-FAMILY: Helvetica
}
H3 {
	FONT-WEIGHT: bold; FONT-FAMILY: Helvetica
}
H4 {
	FONT-WEIGHT: bold; FONT-FAMILY: Helvetica
}
H1 {
	MARGIN-TOP: 8px; COLOR: #cc2200; TEXT-ALIGN: center
}
H2 {
	MARGIN-TOP: 8px; COLOR: #cc2200; TEXT-ALIGN: center
}
H3 {
	MARGIN-TOP: 6px; PADDING-BOTTOM: 0px; COLOR: #333333; TEXT-ALIGN: left
}
H3.entry {
	COLOR: #cc2200
}
H4.contributor {
	MARGIN-TOP: 1px; COLOR: #993300
}
H1 {
	MARGIN-BOTTOM: 2px
}
H2 {
	MARGIN-BOTTOM: 2px
}
H3 {
	MARGIN-BOTTOM: 2px
}
H4 {
	MARGIN-BOTTOM: 2px
}
BODY {
	BACKGROUND-IMAGE: url(/backgrounds/blueonwhite.jpg); MARGIN-LEFT: 5%; =
MARGIN-RIGHT: 5%; FONT-FAMILY: Helvetica
}
HEAD {
=09
}
TABLE {
=09
}
BLOCKQUOTE {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
P {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
TD {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
UL {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
OL {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
LI {
	MARGIN-TOP: 2px; MARGIN-BOTTOM: 0px
}
A:link {
	COLOR: #993300
}
A:active {
	COLOR: brown
}
A:visited {
	COLOR: green
}
.author {
	TEXT-ALIGN: center
}
.chapter {
	FONT-WEIGHT: bold; COLOR: #333333
}
.contents {
	FONT-WEIGHT: bold; COLOR: #cc2200
}
.smallred {
	FONT-SIZE: small; COLOR: crimson
}
.smallbrown {
	FONT-SIZE: small; COLOR: brown
}
.nomargins {
	MARGIN-TOP: 0px
}
.toc {
	COLOR: crimson; TEXT-ALIGN: left
}

------=_NextPart_000_0000_01C82C3C.7D87F0A0--