Load correct weight property for Louvain

Add bigger ASP test that compares multiple SP impl
Don't require weightProp for Louvain
Fix SSP test

Author: knutwalker

algo/src/main/java/org/neo4j/graphalgo/LouvainProc.java

@@ -131,8 +131,8 @@ private HeavyGraph load(ProcedureConfiguration config) {
         return (HeavyGraph) new GraphLoader(api, Pools.DEFAULT)
                 .withOptionalLabel(config.getNodeLabelOrQuery())
                 .withOptionalRelationshipType(config.getRelationshipOrQuery())
-                .withRelationshipWeightsFromProperty(
-                        ProcedureConstants.PROPERTY_PARAM,
+                .withOptionalRelationshipWeightsFromProperty(
+                        config.getProperty(),
                         config.getPropertyDefaultValue(1.0))
                 .withDirection(Direction.BOTH)
                 .load(HeavyGraphFactory.class);

algo/src/main/java/org/neo4j/graphalgo/impl/ShortestPathDijkstra.java

@@ -38,8 +38,6 @@ public class ShortestPathDijkstra extends Algorithm<ShortestPathDijkstra> {
     private final int nodeCount;
     // overall cost of the path
     private double totalCost;
-    // target node id
-    private int goal;
     private ProgressLogger progressLogger;
 
     public ShortestPathDijkstra(Graph graph) {
@@ -66,24 +64,21 @@ public ShortestPathDijkstra compute(long startNode, long goalNode) {
     }
 
     public ShortestPathDijkstra compute(long startNode, long goalNode, Direction direction) {
-        visited.clear();
-        queue.clear();
+        reset();
+
         int node = graph.toMappedNodeId(startNode);
-        goal = graph.toMappedNodeId(goalNode);
+        int goal = graph.toMappedNodeId(goalNode);
         costs.put(node, 0.0);
         queue.add(node, 0.0);
         run(goal, direction);
-        finalPath.clear();
-        totalCost = NO_PATH_FOUND;
         if (!path.containsKey(goal)) {
             return this;
         }
+        totalCost = costs.get(goal);
         int last = goal;
-        totalCost = 0.0;
         while (last != PATH_END) {
             finalPath.addFirst(last);
             last = path.getOrDefault(last, PATH_END);
-            totalCost += costs.get(last);
         }
         return this;
     }
@@ -166,6 +161,15 @@ public ShortestPathDijkstra release() {
         return this;
     }
 
+    private void reset() {
+        visited.clear();
+        queue.clear();
+        costs.clear();
+        path.clear();
+        finalPath.clear();
+        totalCost = NO_PATH_FOUND;
+    }
+
     /**
      * Result DTO
      */