# 36 Graphs Written by Vincent Ngo

You can unlock the rest of this book, and our entire catalogue of books and videos, with a raywenderlich.com Professional subscription.

What do social networks have in common with booking cheap flights around the world? You can represent both of these real-world models as graphs!

A graph is a data structure that captures relationships between objects. It is made up of vertices connected by edges.

In the graph below, the vertices are represented by circles, and the edges are the lines that connect them.

## Weighted graphs

In a weighted graph, every edge has a weight associated with it that represents the cost of using this edge. This lets you choose the cheapest or shortest path between two vertices.

Take the airline industry as an example and think of a network with varying flight paths:

In this example, the vertices represent a state or country, while the edges represent a route from one place to another. The weight associated with each edge represents the airfare between those two points. Using this network, you can determine the cheapest flights from San Francisco to Singapore for all those budget-minded digital nomads out there!

### Directed graphs

As well as assigning a weight to an edge, your graphs can also have direction. Directed graphs are more restrictive to traverse, as an edge may only permit traversal in one direction. The diagram below represents a directed graph.

### Undirected graphs

You can think of an undirected graph as a directed graph where all edges are bi-directional.

## Common operations

Let’s establish a protocol for graphs.

``````public enum EdgeType {

case directed
case undirected
}

public protocol Graph {

associatedtype Element

func createVertex(data: Element) -> Vertex<Element>
to destination: Vertex<Element>,
weight: Double?)
and destination: Vertex<Element>,
weight: Double?)
func add(_ edge: EdgeType, from source: Vertex<Element>,
to destination: Vertex<Element>,
weight: Double?)
func edges(from source: Vertex<Element>) -> [Edge<Element>]
func weight(from source: Vertex<Element>,
to destination: Vertex<Element>) -> Double?
}
``````

## Defining a vertex

``````public struct Vertex<T> {

public let index: Int
public let data: T
}
``````
``````extension Vertex: Hashable where T: Hashable {}
extension Vertex: Equatable where T: Equatable {}
``````
``````extension Vertex: CustomStringConvertible {

public var description: String {
"\(index): \(data)"
}
}
``````

## Defining an edge

To connect two vertices, there must be an edge between them!

``````public struct Edge<T> {

public let source: Vertex<T>
public let destination: Vertex<T>
public let weight: Double?
}
``````

The first graph implementation that you’ll learn uses an adjacency list. For every vertex in the graph, the graph stores a list of outgoing edges.

## Implementation

``````public class AdjacencyList<T: Hashable>: Graph {

private var adjacencies: [Vertex<T>: [Edge<T>]] = [:]

public init() {}

// more to come ...
}
``````

### Creating a vertex

Add the following method to `AdjacencyList`:

``````public func createVertex(data: T) -> Vertex<T> {
let vertex = Vertex(index: adjacencies.count, data: data)
return vertex
}
``````

### Creating a directed edge

Recall that there are directed and undirected graphs.

``````public func addDirectedEdge(from source: Vertex<T>,
to destination: Vertex<T>,
weight: Double?) {
let edge = Edge(source: source,
destination: destination,
weight: weight)
}
``````

### Creating an undirected edge

You just created a method to add a directed edge between two vertices. How would you create an undirected edge between two vertices?

``````extension Graph {

and destination: Vertex<Element>,
weight: Double?) {
addDirectedEdge(from: source, to: destination, weight: weight)
addDirectedEdge(from: destination, to: source, weight: weight)
}
}
``````
``````public func add(_ edge: EdgeType, from source: Vertex<Element>,
to destination: Vertex<Element>,
weight: Double?) {
switch edge {
case .directed:
addDirectedEdge(from: source, to: destination, weight: weight)
case .undirected:
addUndirectedEdge(between: source, and: destination, weight: weight)
}
}
``````

### Retrieving the outgoing edges from a vertex

Back in AdjacencyList.swift, continue your work on conforming to `Graph` by adding the following method:

``````public func edges(from source: Vertex<T>) -> [Edge<T>] {
}
``````

### Retrieving the weight of an edge

How much is the flight from Singapore to Tokyo?

``````public func weight(from source: Vertex<T>,
to destination: Vertex<T>) -> Double? {
edges(from: source)
.first { \$0.destination == destination }?
.weight
}
``````

Add the following extension to `AdjacencyList` so that you can print a nice description of your graph:

``````extension AdjacencyList: CustomStringConvertible {

public var description: String {
var result = ""
for (vertex, edges) in adjacencies { // 1
var edgeString = ""
for (index, edge) in edges.enumerated() { // 2
if index != edges.count - 1 {
edgeString.append("\(edge.destination), ")
} else {
edgeString.append("\(edge.destination)")
}
}
result.append("\(vertex) ---> [ \(edgeString) ]\n") // 3
}
return result
}
}
``````

### Building a network

Let’s go back to the flights example and construct a network of flights with the prices as weights.

``````let graph = AdjacencyList<String>()

let singapore = graph.createVertex(data: "Singapore")
let tokyo = graph.createVertex(data: "Tokyo")
let hongKong = graph.createVertex(data: "Hong Kong")
let detroit = graph.createVertex(data: "Detroit")
let sanFrancisco = graph.createVertex(data: "San Francisco")
let washingtonDC = graph.createVertex(data: "Washington DC")
let austinTexas = graph.createVertex(data: "Austin Texas")
let seattle = graph.createVertex(data: "Seattle")

graph.add(.undirected, from: singapore, to: hongKong, weight: 300)
graph.add(.undirected, from: singapore, to: tokyo, weight: 500)
graph.add(.undirected, from: hongKong, to: tokyo, weight: 250)
graph.add(.undirected, from: tokyo, to: detroit, weight: 450)
graph.add(.undirected, from: tokyo, to: washingtonDC, weight: 300)
graph.add(.undirected, from: hongKong, to: sanFrancisco, weight: 600)
graph.add(.undirected, from: detroit, to: austinTexas, weight: 50)
graph.add(.undirected, from: austinTexas, to: washingtonDC, weight: 292)
graph.add(.undirected, from: sanFrancisco, to: washingtonDC, weight: 337)
graph.add(.undirected, from: washingtonDC, to: seattle, weight: 277)
graph.add(.undirected, from: sanFrancisco, to: seattle, weight: 218)
graph.add(.undirected, from: austinTexas, to: sanFrancisco, weight: 297)

print(graph)
``````
``````2: Hong Kong ---> [ 0: Singapore, 1: Tokyo, 4: San Francisco ]
4: San Francisco ---> [ 2: Hong Kong, 5: Washington DC, 7: Seattle, 6: Austin Texas ]
5: Washington DC ---> [ 1: Tokyo, 6: Austin Texas, 4: San Francisco, 7: Seattle ]
6: Austin Texas ---> [ 3: Detroit, 5: Washington DC, 4: San Francisco ]
7: Seattle ---> [ 5: Washington DC, 4: San Francisco ]
0: Singapore ---> [ 2: Hong Kong, 1: Tokyo ]
1: Tokyo ---> [ 0: Singapore, 2: Hong Kong, 3: Detroit, 5: Washington DC ]
3: Detroit ---> [ 1: Tokyo, 6: Austin Texas ]
``````
``````graph.weight(from: singapore, to: tokyo)
``````
``````print("San Francisco Outgoing Flights:")
print("--------------------------------")
for edge in graph.edges(from: sanFrancisco) {
print("from: \(edge.source) to: \(edge.destination)")
}
``````

An adjacency matrix uses a square matrix to represent a graph. This matrix is a two-dimensional array wherein the value of `matrix[row][column]` is the weight of the edge between the vertices at `row` and `column`.

## Implementation

Create a new file named AdjacencyMatrix.swift and add the following to it:

``````public class AdjacencyMatrix<T>: Graph {

private var vertices: [Vertex<T>] = []
private var weights: [[Double?]] = []

public init() {}

// more to come ...
}
``````

### Creating a Vertex

Add the following method to `AdjacencyMatrix`:

``````public func createVertex(data: T) -> Vertex<T> {
let vertex = Vertex(index: vertices.count, data: data)
vertices.append(vertex) // 1
for i in 0..<weights.count { // 2
weights[i].append(nil)
}
let row = [Double?](repeating: nil, count: vertices.count) // 3
weights.append(row)
return vertex
}
``````

### Creating edges

Creating edges is as simple as filling in the matrix. Add the following method:

``````public func addDirectedEdge(from source: Vertex<T>,
to destination: Vertex<T>, weight: Double?) {
weights[source.index][destination.index] = weight
}
``````

### Retrieving the outgoing edges from a vertex

``````public func edges(from source: Vertex<T>) -> [Edge<T>] {
var edges: [Edge<T>] = []
for column in 0..<weights.count {
if let weight = weights[source.index][column] {
edges.append(Edge(source: source,
destination: vertices[column],
weight: weight))
}
}
return edges
}
``````

### Retrieving the weight of an edge

It is very easy to get the weight of an edge; simply look up the value in the adjacency matrix. Add this method:

``````public func weight(from source: Vertex<T>,
to destination: Vertex<T>) -> Double? {
weights[source.index][destination.index]
}
``````

Finally, add the following extension so you can print out a nice, readable description of your graph:

``````extension AdjacencyMatrix: CustomStringConvertible {

public var description: String {
// 1
let verticesDescription = vertices.map { "\(\$0)" }
.joined(separator: "\n")
// 2
var grid: [String] = []
for i in 0..<weights.count {
var row = ""
for j in 0..<weights.count {
if let value = weights[i][j] {
row += "\(value)\t"
} else {
row += "ø\t\t"
}
}
grid.append(row)
}
let edgesDescription = grid.joined(separator: "\n")
// 3
return "\(verticesDescription)\n\n\(edgesDescription)"
}
}
``````

### Building a network

You will reuse the same example from `AdjacencyList`:

``````let graph = AdjacencyList<String>()
``````
``````let graph = AdjacencyMatrix<String>()
``````
``````0: Singapore
1: Tokyo
2: Hong Kong
3: Detroit
4: San Francisco
5: Washington DC
6: Austin Texas
7: Seattle
ø		500.0	300.0	ø		ø		ø		ø		ø
500.0	ø		250.0	450.0	ø		300.0	ø		ø
300.0	250.0	ø		ø		600.0	ø		ø		ø
ø		450.0	ø		ø		ø		ø		50.0	ø
ø		ø		600.0	ø		ø		337.0	297.0	218.0
ø		300.0	ø		ø		337.0	ø		292.0	277.0
ø		ø		ø		50.0	297.0	292.0	ø		ø
ø		ø		ø		ø		218.0	277.0	ø		ø
San Francisco Outgoing Flights:
--------------------------------
from: 4: San Francisco to: 2: Hong Kong
from: 4: San Francisco to: 5: Washington DC
from: 4: San Francisco to: 6: Austin Texas
from: 4: San Francisco to: 7: Seattle
``````

## Graph analysis

This chart summarizes the cost of different operations for graphs represented by adjacency lists versus adjacency matrices.

## Key points

Have a technical question? Want to report a bug? You can ask questions and report bugs to the book authors in our official book forum here.

Have feedback to share about the online reading experience? If you have feedback about the UI, UX, highlighting, or other features of our online readers, you can send them to the design team with the form below:  