graaf 0.2.2

Functions and types for working with graphs
Documentation
# Graaf

Functions and types for working with graphs.

**WARNING: this crate is pre-alpha**

## Algorithms

### Shortest path

`DijkstraUnweighted`

Dijkstra's algorithm with binary heap for unweighted directed graphs. Works on graph representations that implement `AddEdge`.

`DijkstraWeighted`

Dijkstra's algorithm with binary heap for weighted directed graphs. Works on graph representations that implement `AddWeightedEdge`.

## Graph operation traits

- `AddEdge` adds an edge to an unweighted graph
- `AddWeightedEdge` adds an edge to a weighted graph
- `CountAllEdges` counts all edges in a graph
- `CountAllVertices` counts all vertices in a graph
- `EdgeWeight` gets the weight of a given edge
- `Indegree` returns the indegree of a given vertex
- `IsEdge` returns whether an edge exists between two vertices
- `IterAllEdges` iterates over all unweighted edges in a graph
- `IterAllWeightedEdges` iterates over all weighted edges in a graph
- `IterEdges` iterates over all unweighted edges with a given source vertex
- `IterVertices` iterates over all vertices in a graph
- `IterWeightedEdges` iterates over all weighted edges with a given source vertex
- `Outdegree` returns the outdegree of a vertex
- `RemoveEdge` removes an edge from a graph
- `VertexWeight` returns the weight of a given vertex

## Graph representations

### Adjacency list

- `Vec<Vec<usize>>`
- `Vec<Vec<(usize, usize)>>`
- `Vec<HashSet<usize>>`
- `Vec<HashSet<usize, W>>`
- `Vec<HashMap<usize, W>>`
- `[Vec<usize>]`
- `[Vec<(usize, usize)>]`
- `[HashSet<usize>]`
- `[HashSet<usize, W>]`
- `[HashMap<usize, W>]`
- `HashMap<usize, Vec<usize>>`
- `HashMap<usize, Vec<(usize, W)>>`
- `HashMap<usize, HashSet<usize>>`
- `HashMap<usize, HashSet<(usize, W)>>`
- `HashMap<usize, HashMap<usize, W>>`

### Adjacency matrix

`AdjacencyMatrix`

An adjacency matrix representation of an unweighted directed graph stored as a bit array.

### Edge list

- `Vec<(usize, usize)>`
- `Vec<(usize, usize, W)>`
- `[(usize, usize)]`
- `[(usize, usize, W)]`
- `HashSet<(usize, usize)>`
- `HashSet<(usize, usize, W)>`