DirectedAMatrix Class Reference
DirectedAMatrix
final public class DirectedAMatrix<Vertex: Hashable>: AdjacencyMatrix<Vertex>,
DirectedGraphAdjacency matrices for directed graphs.
-
Undocumented
Declaration
Swift
final public class DirectedAMatrix<Vertex: Hashable>: AdjacencyMatrix<Vertex>, DirectedGraph -
An array of all the edges in the graph, represented as tuples of vertices.
The first vertex in each tuple is the source of the edge, and the second is the destination.
Complexity
O(V²)Declaration
Swift
public var edges: [(Vertex, Vertex)] -
Returns whether there is an edge from one vertex to another in the graph.
Throws
GraphError.VertexNotPresentif either vertex is not in the graph.Complexity
O(1)
Declaration
Swift
public func edgeExists(from: Vertex, to: Vertex) throws -> BoolParameters
fromThe vertex to check from.
toThe destination vertex.
Return Value
trueif the edge exists;falseotherwise. -
Creates an array of all vertices reachable in one step from a vertex.
Throws
GraphError.VertexNotPresentifvertexis not in the graph.Complexity
O(V)
Declaration
Swift
public func neighbors(vertex: Vertex) throws -> [Vertex]Parameters
vertexThe vertex whose neighbors to retrieve.
Return Value
An array of all vertices with edges from
vertexto them, in no particular order, and not includingvertexunless there is a loop. -
Adds a new edge from one edge to another.
Changes the graph in-place to add the edge. The new edge will go from
fromtoto.Throws
GraphError.VertexNotPresentif either vertex is not in the graph.Complexity
O(1)
Declaration
Swift
public func addEdge(from: Vertex, to: Vertex) throwsParameters
fromThe ‘source’ of the edge.
toThe ‘destination’ of the edge.
-
Removes an edge from one vertex to another.
Throws
GraphError.EdgeNotPresentif the edge to be removed is not in the graph.Complexity
O(1)
Declaration
Swift
public func removeEdge(from: Vertex, to: Vertex) throwsParameters
fromThe ‘source’ of the edge.
toThe ‘destination’ of the edge.