Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Swift Data Structure and Algorithms

You're reading from   Swift Data Structure and Algorithms Implement Swift structures and algorithms natively

Arrow left icon
Product type Paperback
Published in Nov 2016
Publisher Packt
ISBN-13 9781785884504
Length 286 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
 Alebicto Alebicto
Author Profile Icon Alebicto
Alebicto
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Swift Data Structure and Algorithms
Credits
About the Authors
About the Reviewers
www.PacktPub.com
Preface
1. Walking Across the Playground FREE CHAPTER 2. Working with Commonly Used Data Structures 3. Standing on the Shoulders of Giants 4. Sorting Algorithms 5. Seeing the Forest through the Tree 6. Advanced Searching Methods 7. Graph Algorithms 8. Performance and Algorithm Efficiency 9. Choosing the Perfect Algorithm

Data structures


We are going to implement the vertex and edge entities using an approach with structs, generics, and protocols. We are going to start building the basic blocks (vertex, edge), and then we will create further data structures on top of them (adjacency list, graph), and so on.

Vertex

We are going to add a new struct to represent the vertex entity. Create a new playground file in Xcode and name it B05101_7_AdjacencyList. In the Sources folder, add a new Swift file and name it Vertex.swift. Add the following code to this file:

public struct Vertex<T:Equatable>:Equatable {
    public var data:T
    public let index:Int
}

We have defined the Vertex struct and we have indicated that it uses some generic type, T. We also defined that the generic T must be Equatable. Conforming to the Equatable protocol helps us to make comparisons later.

What do we need to store enough information to represent a vertex? You can see that we defined two properties: some data of generic...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at £13.99/month. Cancel anytime
Visually different images