This PR adds the example for the pagerank algorithm to the set of graybat examples. Furthermore, a new graph generation pattern called Random is added. This new pattern generates a random graph with n vertices which are randomly connected to other vertices. The amount of adjacent vertices is randomly determined between a minimum and maximum amount of edges. The new example was added to the cmake test target.
This PR adds the example for the pagerank algorithm to the set of graybat examples. Furthermore, a new graph generation pattern called Random is added. This new pattern generates a random graph with n vertices which are randomly connected to other vertices. The amount of adjacent vertices is randomly determined between a minimum and maximum amount of edges. The new example was added to the cmake test target.