Book Image

Beginning Java Data Structures and Algorithms

By : Kristian Secor
Book Image

Beginning Java Data Structures and Algorithms

By: Kristian Secor

Overview of this book

Learning about data structures and algorithms gives you better insight on how to solve common programming problems. Most of the problems faced every day by programmers have been solved, tried, and tested. By knowing how these solutions work, you can ensure that you choose the right tool when you face these problems. This course teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You'll also learn about data structures such as binary trees, hash tables, and graphs. The course progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the course, you will know how to correctly implement common algorithms and data structures within your applications.
Table of Contents (6 chapters)
Chapter 6
Graphs, Prime Numbers, and Complexity Classes
Content Locked
Section 2
Representing Graphs
There are usually two standard ways to represent a graph G = (V, E) in a computer program: 1. As a collection of adjacency lists. 2. As an adjacency matrix. You can use either way to represent both directed and undirected graphs. We'll start by looking at the adjacency list representation.