.. This file is part of the OpenDSA eTextbook project. See .. http://algoviz.org/OpenDSA for more details. .. Copyright (c) 2012-2016 by the OpenDSA Project Contributors, and .. distributed under an MIT open source license. .. OpenDSA documentation master file, created by sphinx-quickstart on Sat Mar 17 18:07:39 2012. You can adapt this file completely to your liking, but it should at least contain the root `toctree` directive. .. avmetadata:: OpenDSA Sample eTextbook :author: OpenDSA Contributors :topic: Data Structures .. chapnum:: :start: 0 :prefix: Chapter .. _index: .. raw:: html .. |--| unicode:: U+2013 .. en dash .. |---| unicode:: U+2014 .. em dash, trimming surrounding whitespace :trim: Introduction for Data Structures and Algorithms Courses ======================================================= .. toctree:: :numbered: :maxdepth: 3 IntroDSA Abstract Data Types =================== .. toctree:: :numbered: :maxdepth: 3 ADT SetSearch Binary Trees ============ .. toctree:: :numbered: :maxdepth: 3 BinaryTreeIntro BinaryTree RecursiveDS BinaryTreeTraversal WritingTraversals BinaryTreeInfFlw Graphs ====== .. toctree:: :numbered: :maxdepth: 3 GraphIntro Searching ========= .. toctree:: :numbered: :maxdepth: 3 BinarySearch Mathematical Background ======================= .. toctree:: :numbered: :maxdepth: 3 MathpreIntro SetDef MiscMath Logarithms Summations RecurrenceIntro Proofs Estimation MathpreSumm Algorithm Analysis ================== .. toctree:: :numbered: :maxdepth: 3 AnalChap AnalPrelim AnalIntro AnalCases AnalCompvsAlg AnalAsymptotic AnalLower AnalProgram AnalProblem AnalMisunderstanding AnalMultiple AnalSpace AnalTuning AlgAnalSummCS2 AlgAnalSummCS3 Priority Queues =============== .. toctree:: :numbered: :maxdepth: 3 CompleteTree Heaps Sorting ======= .. toctree:: :numbered: :maxdepth: 3 InSort SortNotation InsertionSort BubbleSort SelectionSort ExchangeSort SortOpt Shellsort Mergesort MergesortImpl Quicksort Heapsort BinSort RadixSort SortingEmpirical SortingLowerBound SortSumm Binary Search Trees =================== .. toctree:: :numbered: :maxdepth: 3 BST BalancedTree Shortest Paths ============== .. toctree:: :numbered: :maxdepth: 3 GraphShortest DynamicProgramming Floyd Topological Sorting =================== .. toctree:: :numbered: :maxdepth: 3 GraphTopsort Disjoint Set Clusters ===================== .. toctree:: :numbered: :maxdepth: 3 UnionFind Minimum Spanning Trees ====================== .. toctree:: :numbered: :maxdepth: 3 MCST Kruskal Appendix ======== .. toctree:: :numbered: :maxdepth: 3 Glossary Bibliography .. toctree:: :maxdepth: 3 * :ref:`genindex` * :ref:`search`