- Java 9 Data Structures and Algorithms
- Table of Contents
- Java 9 Data Structures and Algorithms
- Credits
- About the Author
- About the Reviewer
- www.PacktPub.com
- Customer Feedback
- Preface
- 1. Why Bother? – Basic
- 2. Cogs and Pulleys – Building Blocks
- 3. Protocols – Abstract Data Types
- 4. Detour – Functional Programming
- 5. Efficient Searching – Binary Search and Sorting
- 6. Efficient Sorting – quicksort and mergesort
- 7. Concepts of Tree
- 8. More About Search – Search Trees and Hash Tables
- 9. Advanced General Purpose Data Structures
- 10. Concepts of Graph
- What is a graph?
- The graph ADT
- Representation of a graph in memory
- Traversal of a graph
- Cycle detection
- Spanning tree and minimum spanning tree
- For any tree with vertices V and edges E, |V| = |E| + 1
- Any connected undirected graph has a spanning tree
- Any undirected connected graph with the property |V| = |E| + 1 is a tree
- Cut property
- Minimum spanning tree is unique for a graph that has all the edges whose costs are different from one another
- Finding the minimum spanning tree
- Summary
- 11. Reactive Programming
- Index
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.