Summary

Parallel bellman ford algorithm using rayon. This algorithm can be efficiently paralleled in C/C++ programming using OpenMP, I think it can also be paralleled using Rayon, parallel iterator for rust.

Motivation

Larger scale single source shortest path finding for larger graphs can be very expensive in practice. Using all threads of a computer to accelerate it seems to be interesting.

Details

• What code needs to change? New traits? Which modules?

probably a new function with rayon support is needed.

• Is this a new graph algorithm? Include links to papers, Wikipedia, or other
  implementations of this algorithm that exist.

No, there are existing ways to parallize it using OpenMP

• Are you willing to implement this yourself? Mentor someone else and help them
  implement it?

I am looking for someone who is more experienced to do it.

Thanks,

Jianshu