Summary & motivation

Modern computers have multiple CPU cores, and most have a capable GPU. Capitalizing on this fact would make this crate's algorithms work on much larger graphs than is currently possible in a reasonable amount of time.

Details

Relevant links:

Minimum spanning tree:

• https://en.wikipedia.org/wiki/Minimum_spanning_tree#Parallel_and_distributed_algorithms

Shortest path:

• https://en.wikipedia.org/wiki/Parallel_all-pairs_shortest_path_algorithm

Isomorphism:

• Using adjacency matrices: An Efficient Parallel Algorithm for Graph Isomorphism on GPU using CUDA