Graph Theory problem with c++

I require a skilled programmer to develop a graph theory algorithm using C++. The algorithm should be tailored to solve problems related to graph theory. Specifically, it should be able to solve network flow, shortest path, and maximum matching problems. The algorithm will be applied to a medium-sized graph, with 50-100 vertices. I require the algorithm to be optimized for speed, without compromising on memory usage. Ideal candidates should have experience with graph theory algorithms, as well as expertise in C++ programming.