Netstack rework graph algorithms

I revised the graph algorithms in the JobGraph. I mainly replaced data structures with a linear lookup time by HashSets. In the worst case, these linear lookup times could cause a quadratic runtime in the number of vertices. However, I honestly doubt that this will improve the runtime a lot since the job graph would have to be quite enormous to have a considerable effect. Still, better than nothing.