Etienne dg

For directed graphs, we want to ignore directedness. We would need an efficient wrapper for that instead of allocating a new graph.

We would need to write ``` julia if is_directed(g) g = Graph(g) end ``` before computing `δ`, but this is dramatic for big graphs since it will fully allocate a...

`savegraph` saves by default a MetaGraphs using `JLD2.jl` to HDF5 format. `loadgraph` loads by default a MetaGraphs using LG format. You can load the graph using `loadgraph(fn, gname, MGFormat())` We...

Yes, I found it by digging in the code, we should also document this.

I also run into an infinite loop with Dinic's algorithm. For other algorithms, this should be fine, I see no comparisons between floats

> > I also run into an infinite loop with Dinic's algorithm. > > Did you fix this in this PR or is it still in progress? Yes, this is...

I forgot the sqrt for the epsilon tolerance. This should be ok, except if we want to adapt the tolerance depending on the norm of the capacity matrix

Sorry for the delay, I think this can be merged, if you agree on the fact that we need a separate function to compare the excess against 0

This is probably the same issue. I have filled a PR [#31](https://github.com/JuliaGraphs/LightGraphsFlows.jl/pull/31) fixing the problem, but it is not merged yet. If you really need to get it work, I...

Though far less often, I already ran into infinite loops using dinic's algorithm. My PR should fix this also. While browsing the other files, I realized edmonds_karp could also lead...