Classes

Unweighted Adjacency list.

Stores a graph as a dictionary of vertices with an array of directly adjacent vertices. More memory efficient than adjacency matrices, but determining direct adjacency takes more time.

Includes basic functionality, but cannot be used as a graph because it does not know whether or not it’s directed. Directed and Undirected AList inherit from this class.

An undirected graph implemented as an adjacency list. Edges are symmetric, meaning v is adjacent to u iff u is adjacent to v.

In implementation, this means that if u is in v’s neighbor array, v must also be in u’s neighbor array, for any two vertices.

Directed adjacency list. When using this class, source is different from destination vertex in an edge.

In other words, if u is in v’s neighbor array, v may not be in u’s unless the antiparallel edge exists in the graph.

Implementation of a weighted undirected graph using an adjacency list.

The weights are stored separately from the edges, in a dictionary of dictionaries. Weights are Doubles.

A weighted directed Adjacency List implementation of weighted, directed graphs. Similar to the WeightedUndirected adjacency list, but with asymmetric edges.

Weights are stored separately from edges, in a nested dictionary of type [Vertex: [Vertex: Double]].

Adjacency matrices for general graphs.

The AdjacencyMatrix class is only capable of keeping track of the size and shape of the matrix. To use adjacency matrices as graphs, use its subclasses, UndirectedAMatrix and DirectedAMatrix.

Adjacency matrices for undirected graphs.

Adjacency matrices for directed graphs.