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)

Graphs

Chapter 8, Exploring Graphs, was related to graphs – a very popular data structure with a broad range of applications. As a reminder, a graph is a data structure that consists of nodes and edges. Each edge connects two nodes. There are a few variants of edges in a graph, such as undirected and directed, as well as unweighted and weighted. A graph can be represented as an adjacency list or as an adjacency matrix.

All of these topics were described in the book, together with the problem of graph traversal with breadth-first search and depth-first search algorithms, finding the minimum spanning tree with Kruskal’s and Prim’s algorithms, node coloring, and finding the shortest path in a graph with Dijkstra’s algorithm.

The exemplary graphs are shown in the following illustration:

Figure 10.12 – Illustration of graphs

Figure 10.12 – Illustration of graphs

A graph data structure is commonly used in various applications. It is also a great way to represent...