Comparisons
Our Comparisons
The last projects didn't go well so we can see We actually improved our graph algorithms from the run time bar chart
It was the biggest gap comparison because we added an attribute in python called in_edges that get the edges come in.
On the one hand it increase graph space complexity O(V+2E) but our Kosaraju algorithm was implemented in our java graph and we did transpose the graph each time for single Strongly Connected Component => O(V+E)^2
Here we can see that even when transpose in the graph java the gap isn't that big and java is run faster
My Laptop have the specs of:
i5 6200u
integrated Intel graphics card - nothing
16 GB of ram 2133 MHz
and it's mat black
A0 graph from last assignment
