Write a program in Java/C++ to implement the Ford-Fulkerson Algorithm where the augmenting paths are selected using Dinic's Approach (basically shortest paths). Your algorithm should run in polynomial time. Make sure to use appropriate data structures to ensure that your program runs fast in a practical sense as well. Your input is a Flow Network (i.e., the underlying directed graph, source vertex, sink vertex, capacities of all the edges). Your output should be the following.

1. Value of Max Flow.

2. An actual max flow (specify how much should flow in each edge).

3. Value of Min Cut.

4. An actual min cut (specify edges that form a min cut).