Open
Description
This is to make easy the unit tests of graph algorithms.
Create methods that generate a random graph (undirected and directed) implemented with an adjacency list and depending on:
-
|V| the number of vertices
-
The average degree of its vertices
-
How could we make sure that the graph includes multiple connected components?