Book Image

C# Data Structures and Algorithms - Second Edition

By : Marcin Jamro
Book Image

C# Data Structures and Algorithms - Second Edition

By: Marcin Jamro

Overview of this book

Building your own applications is exciting but challenging, especially when tackling complex problems tied to advanced data structures and algorithms. This endeavor demands profound knowledge of the programming language as well as data structures and algorithms – precisely what this book offers to C# developers. Starting with an introduction to algorithms, this book gradually immerses you in the world of arrays, lists, stacks, queues, dictionaries, and sets. Real-world examples, enriched with code snippets and illustrations, provide a practical understanding of these concepts. You’ll also learn how to sort arrays using various algorithms, setting a solid foundation for your programming expertise. As you progress through the book, you’ll venture into more complex data structures – trees and graphs – and discover algorithms for tasks such as determining the shortest path in a graph before advancing to see various algorithms in action, such as solving Sudoku. By the end of the book, you’ll have learned how to use the C# language to build algorithmic components that are not only easy to understand and debug but also seamlessly applicable in various applications, spanning web and mobile platforms.
Table of Contents (13 chapters)

Traversal

One of the operations that’s commonly performed on a graph is traversal – that is, visiting all of the nodes in some particular order. Of course, the aforementioned problem can be solved in various ways, such as using DFS or BFS approaches. It is worth mentioning that the traversal topic is strictly connected with the task of searching for a given node in a graph.

Depth-first search

The first graph traversal algorithm described in this chapter is named DFS. It tries to go as deep as possible. First, it proceeds to the next levels of the nodes instead of visiting all the neighbors of the current node. Its steps, in the context of the example graph, are as follows:

Figure 8.14 – Illustration of a DFS of a graph

Figure 8.14 – Illustration of a DFS of a graph

Of course, it can be a bit difficult to understand how the DFS algorithm operates just by looking at the preceding diagram. For this reason, let’s try to analyze its stages.

In Step 1, there’s...