Graaf  

Rust-powered directed graphs.

Table of Contents

• Installation
• Representations
• Generators
• Operations
• Algorithms
  • Bellman-Ford-Moore
  • Breadth-First Search
  • Depth-First Search
  • Dijkstra
  • Distance Matrix
  • Floyd-Warshall
  • Predecessor Tree
  • Tarjan
• Changelog
• License
• Contact
• Links

Installation

Add the following to your Cargo.toml:

[dependencies]
graaf = "0.88.7"

Representations

• AdjacencyList represents unweighted sparse digraphs.
• AdjacencyMatrix represents unweighted dense digraphs.
• AdjacencyListWeighted represents arc-weighted sparse digraphs.
• EdgeList represents unweighted sparse digraphs.

Generators

• Biclique generates a complete bipartite digraph.
• Circuit generates a circuit digraph.
• Complete generates a complete digraph.
• Cycle generates a bidirectional circuit.
• Empty generates a digraph with no arcs.
• ErdosRenyi generates a random digraph.
• Path generates a path digraph.
• RandomTournament generates a random tournament.
• Star generates a star digraph.
• Wheel generates a wheel digraph.

Operations

• AddArcWeighted adds an arc to an arc-weighted digraph.
• AddArc adds an arc to an unweighted digraph.
• ArcWeight returns an arc's weight.
• ArcsWeighted iterates a digraph's weighted arcs.
• Arcs iterates a digraph's arcs.
• Complement returns a digraph's complement.
• Converse returns a digraph's converse.
• DegreeSequence iterates a digraph's degrees.
• Degree returns a vertex's degree.
• HasArc checks whether a digraph contains an arc.
• HasEdge checks whether a digraph contains an edge.
• HasWalk checks whether a digraph contains a walk.
• InNeighbors iterates a vertex's in-neighbors.
• IndegreeSequence iterates a digraph's indegrees.
• Indegree returns a vertex's indegree.
• IsBalanced checks whether a digraph is balanced.
• IsComplete checks whether a digraph is complete.
• IsIsolated checks whether a vertex is isolated.
• IsOriented checks whether a digraph is oriented.
• IsPendant checks whether a vertex is a pendant.
• IsRegular checks whether a digraph is regular.
• IsSemicomplete checks whether a digraph is semicomplete.
• IsSimple checks whether a digraph is simple.
• IsSpanningSubdigraph checks whether a digraph spans a superdigraph.
• IsSubdigraph checks whether a digraph is a subdigraph.
• IsSuperdigraph checks whether a digraph is a superdigraph.
• IsSymmetric checks whether a digraph is symmetric.
• IsTournament checks whether a digraph is a tournament.
• Order returns the number of vertices in a digraph.
• OutNeighborsWeighted iterates a vertex's weighted out-neighbors.
• OutNeighbors iterates a vertex's out-neighbors.
• OutdegreeSequence iterates a digraph's outdegrees.
• Outdegree returns a vertex's outdegree.
• RemoveArc removes an arc from a digraph.
• SemidegreeSequence iterates a digraph's semidegrees.
• Sinks iterates a digraph's sinks.
• Size returns the number of arcs in a digraph.
• Sources iterates a digraph's sources.
• Union returns the union of two digraphs.
• Vertices iterates a digraph's vertices.

Algorithms

Bellman-Ford-Moore

The Bellman-Ford-Moore algorithm finds the shortest distances from a source vertex to all other vertices in an arc-weighted digraph with negative weights.

• bellman_ford_moore::single_source_distancesfinds the shortest distances.

Breadth-First Search

A breadth-first search explores the vertices of an unweighted digraph in order of their distance from a source.

• Bfs iterates the vertices.
• BfsDist iterates the vertices and their distance from the source.
• BfsPred iterates the vertices and their predecessors.
• BfsDist::distances finds the shortest distances.
• BfsPred::cycles returns the cycles along the shortest path.
• BfsPred::predecessors finds the predecessors.
• BfsPred::shortest_path finds the shortest path.

Depth-First Search

A depth-first search explores the vertices of an unweighted digraph in order of their depth from a source.

• Dfs iterates the vertices.
• DfsDist iterates the vertices and their distance from the source.
• DfsPred iterates the vertices and their predecessors.
• DfsPred::predecessors finds the predecessors.

Dijkstra

Dijkstra's algorithm finds the shortest paths in an arc-weighted digraph.

• Dijkstra iterates the vertices.
• DijkstraDist iterates the vertices.
• DijkstraPred iterates the vertices and their predecessors.
• DijkstraDist::distances finds the shortest distances.
• DijkstraPred::predecessors finds the predecessors.
• DijkstraPred::shortest_path finds the shortest path.

Distance Matrix

A DistanceMatrix contains the shortest distances between all pairs of vertices in a digraph.

• DistanceMatrix::center finds the center of the digraph.
• DistanceMatrix::diameter finds the diameter of the digraph.
• DistanceMatrix::eccentricities returns the eccentricities of the vertices.
• DistanceMatrix::is_connected checks if the digraph is connected.
• DistanceMatrix::periphery finds the periphery of the digraph.

Floyd-Warshall

The Floyd-Warshall algorithm finds the distance between each pair of vertices in an arc-weighted digraph.

• floyd_warshall::distances finds the shortest distances.

Predecessor Tree

A PredecessorTree is the result of a search and contains the predecessors of the vertices.

• PredecessorTree::search finds a vertex by value.
• PredecessorTree::search_by finds a vertex by predicate.

Tarjan

Tarjan's algorithm finds strongly connected components in a digraph.

• tarjan::strongly_connected_components finds strongly connected components.

Changelog

See CHANGELOG.md for a list of changes.

License

Licensed under Apache License, Version 2.0 or MIT license at your option.

Contact

Feel free to reach out with questions or suggestions.

• Email
• GitHub

Links

• Coveralls
• Crates.io
• Docs.rs