In this chapter, we covered ways of representing and traversing a graph and looked at shortest path algorithms. Graphs are also an optimal data structure for some problems we haven't mentioned yet. This section aims to introduce some of them.
- Title Page
- Copyright and Credits
- Packt Upsell
- Contributors
- Preface
- Algorithms and Complexities
- Sorting Algorithms and Fundamental Data Structures
- Hash Tables and Binary Search Trees
- Introducing Hash Tables
- Getting Started with Binary Search Trees
- Summary
- Algorithm Design Paradigms
- Introducing Greedy Algorithms
- Getting Started with Divide and Conquer Algorithms
- Understanding Dynamic Programming
- Summary
- String Matching Algorithms
- Graphs, Prime Numbers, and Complexity Classes
- Other Books You May Enjoy
Other Concepts in Graphs
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.