-
Notifications
You must be signed in to change notification settings - Fork 122
Description
We recently introduced two types called GenericGraph and GenericDiGraph that wrap a SimpleGraph or a SimpleDiGraph. These generic types try to fulfill the AbstractGraph interface in a minimal way, while having no other methods implemented. The idea is then to test functions that can take an AbstractGraph with these generic types instead of simple graphs, in order to verify that they would indeed work with any AbstractGraph.
Similar things can be found in the Julia standard library, for example Test.GenericArray and Test.GenericString.
Now we need to change our tests, so that they use the generic graph types, and try to spot and fix bugs that occur during that process. It is probably not possible to do this for all functions, but at least we can spot the places where that is the case.
Some progress has already been done or at least started in:
-
test/biconnectivityUse GenericGraph for testing biconnectivity algorithms #270 -
test/centralityTest centrality with generic graph #272 -
test/communityTest community with generic graph #273 -
test/cyclesTest cycles with generic graph #274 -
test/shortestpathsUse GenericGraph for testing shortestpaths algorithms #275 -
test/spanningtreesUse GenericGraph for testing spanningtrees algorithms #276 -
test/connectivity.jlTests for various files with generic graph #278 -
test/core.jlTests for various files with generic graph #278 -
test/degeneracy.jlTests for various files with generic graph #278 -
test/distance.jlTests for various files with generic graph #278 -
test/edit_distance.jlTests for various files with generic graph #278 -
test/operators.jlTests for various files with generic graph #278