Book Image

Swift Data Structure and Algorithms

By : Mario Eguiluz Alebicto
Book Image

Swift Data Structure and Algorithms

By: Mario Eguiluz Alebicto

Overview of this book

Apple’s Swift language has expressive features that are familiar to those working with modern functional languages, but also provides backward support for Objective-C and Apple’s legacy frameworks. These features are attracting many new developers to start creating applications for OS X and iOS using Swift. Designing an application to scale while processing large amounts of data or provide fast and efficient searching can be complex, especially running on mobile devices with limited memory and bandwidth. Learning about best practices and knowing how to select the best data structure and algorithm in Swift is crucial to the success of your application and will help ensure your application is a success. That’s what this book will teach you. Starting at the beginning, this book will cover the basic data structures and Swift types, and introduce asymptotic analysis. You’ll learn about the standard library collections and bridging between Swift and Objective-C collections. You will see how to implement advanced data structures, sort algorithms, work with trees, advanced searching methods, use graphs, and performance and algorithm efficiency. You’ll also see how to choose the perfect algorithm for your problem.
Table of Contents (15 chapters)
Swift Data Structure and Algorithms
Credits
About the Authors
About the Reviewers
www.PacktPub.com
Preface

Chapter 7. Graph Algorithms

Graph algorithms and graph theory were discovered a long time ago, but nowadays they are a common practice in a lot of scenarios. The different algorithms that involve graphs are used in lots of applications in our day to day operations. Think of how social networks recommend new friends to you (which are always related to you in some way, such as a friend of a friend of mine) or how a GPS is able to find the shortest path between an origin and a destination. These kinds of problem can be solved with graph algorithm techniques, and we are going to discuss some of them throughout this chapter.

The topics covered in this chapter are as follows:

  • Learning about graph theory

  • Data structures for graphs

  • Depth first search

  • Breadth first search

  • Spanning tree

  • Shortest path

  • SwiftGraph