scisoftdev-tmp-HiPOP 1.0.10__tar.gz → 1.0.11__tar.gz

{scisoftdev_tmp_hipop-1.0.10 → scisoftdev_tmp_hipop-1.0.11}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: scisoftdev-tmp-HiPOP
-Version: 1.0.10
+Version: 1.0.11
 Summary: High Performance Optimal Path module
 Keywords: graph,graph-theory,shortest-path,dijkstra
 License-Expression: LGPL-3.0-only

scisoftdev_tmp_hipop-1.0.11/VERSION.txt

@@ -0,0 +1 @@
+1.0.11

{scisoftdev_tmp_hipop-1.0.10 → scisoftdev_tmp_hipop-1.0.11}/cpp/src/shortest_path.cpp

@@ -381,10 +381,12 @@ namespace hipop
         std::vector<std::string> origins, 
         std::vector<std::string> destinations,
         std::vector<std::unordered_map<std::string, std::string> > vecMapLabelCosts,
-        std::string cost,
-        int,
+        std::string cost, 
+        int threadNumber, 
         std::vector<setstring> vecAvailableLabels)
     {
+        omp_set_num_threads(threadNumber);
+
         int nbPath = origins.size();
         std::vector<int> emptyV;
         std::vector<int> uniqueIndices;
@@ -434,9 +436,11 @@ namespace hipop
         std::vector<std::string> origins,
         std::vector<std::unordered_map<std::string, std::string> > vecMapLabelCosts,
         std::string cost,
-        int,
+        int threadNumber,
         std::vector<setstring> vecAvailableLabels)
     {
+        omp_set_num_threads(threadNumber);
+
         int nbSPTs = origins.size();
         std::vector<ShortestPathsTree> res(nbSPTs);
 
@@ -474,9 +478,11 @@ namespace hipop
         std::vector<std::string> destinations,
         std::vector<std::unordered_map<std::string, std::string> > vecMapLabelCosts,
         std::vector<std::string> costs,
-        int,
+        int threadNumber,
         std::vector<setstring> vecAvailableLabels)
     {
+        omp_set_num_threads(threadNumber);
+
         std::vector<int> emptyV;
         std::vector<int> uniqueIndices;
         std::unordered_map<int, int> duplicateIndices;
@@ -698,8 +704,9 @@ namespace hipop
         const std::vector<std::vector<std::vector<std::string>>> &paths,
         const std::string &cost,
         const std::unordered_map<std::string, std::string> mapLabelCost,
-        int)
+        int threadNumber)
     {
+        omp_set_num_threads(threadNumber);
         int nbBatches = paths.size();
 
         std::vector<std::vector<double>> res(nbBatches);
@@ -1099,8 +1106,10 @@ namespace hipop
         double costMultiplier,
         int maxRetry,
         const std::vector<int> &kPaths,
-        int)
+        int threadNumber)
     {
+        omp_set_num_threads(threadNumber);
+
         int nbODs = origins.size();
         std::vector<std::vector<pathCost>> res(nbODs);
         OrientedGraph *privateG;
@@ -1308,7 +1317,7 @@ namespace hipop
         std::vector<std::string> destinations,
         std::vector<std::unordered_map<std::string, std::string> > vecMapLabelCosts,
         std::string cost,
-        int,
+        int threadNumber,
         std::pair<std::unordered_set<std::string>, std::unordered_set<std::string>> pairMandatoryLabels,
         double maxDiffCost,
         double maxDistInCommon,
@@ -1438,6 +1447,8 @@ namespace hipop
         }
 
         // Launch dijkstra algo for each OD in parallel
+        omp_set_num_threads(threadNumber);
+
         int nbOD = origins.size();
         std::vector<std::vector<pathCost>> res(nbOD);
 

scisoftdev_tmp_hipop-1.0.11/python/hipop/shortest_path.py

@@ -0,0 +1 @@
+from hipop.cpp.shortest_path import (dijkstra, dijkstra_single_source, floyd_warshall, parallel_dijkstra, parallel_dijkstra_single_source, parallel_dijkstra_heterogeneous_costs, parallel_k_intermodal_shortest_path, k_shortest_path, parallel_k_shortest_path, astar_euclidian_dist, compute_path_length, compute_path_cost, compute_paths_costs)

scisoftdev_tmp_hipop-1.0.10/VERSION.txt

@@ -1 +0,0 @@
-1.0.10

scisoftdev_tmp_hipop-1.0.10/python/hipop/shortest_path.py

@@ -1,68 +0,0 @@
-import functools
-import time
-
-from hipop.cpp.shortest_path import (
-    dijkstra,
-    dijkstra_single_source,
-    floyd_warshall,
-    parallel_dijkstra,
-    parallel_dijkstra_single_source,
-    parallel_dijkstra_heterogeneous_costs,
-    parallel_k_intermodal_shortest_path,
-    k_shortest_path,
-    parallel_k_shortest_path,
-    astar_euclidian_dist,
-    compute_path_length,
-    compute_path_cost,
-    compute_paths_costs,
-)
-
-_EXPORTED_FUNCTIONS = (
-    "dijkstra",
-    "dijkstra_single_source",
-    "floyd_warshall",
-    "parallel_dijkstra",
-    "parallel_dijkstra_single_source",
-    "parallel_dijkstra_heterogeneous_costs",
-    "parallel_k_intermodal_shortest_path",
-    "k_shortest_path",
-    "parallel_k_shortest_path",
-    "astar_euclidian_dist",
-    "compute_path_length",
-    "compute_path_cost",
-    "compute_paths_costs",
-)
-
-_stats = {name: {"calls": 0, "total_time": 0.0} for name in _EXPORTED_FUNCTIONS}
-
-
-def _track_calls(func):
-
-    @functools.wraps(func)
-    def wrapper(*args, **kwargs):
-        stats = _stats[func.__name__]
-        start = time.perf_counter()
-        try:
-            return func(*args, **kwargs)
-        finally:
-            stats["calls"] += 1
-            stats["total_time"] += time.perf_counter() - start
-
-    return wrapper
-
-
-for _name in _EXPORTED_FUNCTIONS:
-    globals()[_name] = _track_calls(globals()[_name])
-del _name
-
-
-def report_hipop_call_stats():
-    """Log the number of invocations and cumulative C++ execution time for each
-    exported function that has been called at least once."""
-    at_least_one_call = False
-    for name, stats in _stats.items():
-        if stats["calls"] > 0:
-            at_least_one_call = True
-            print(f"HiPOP fun {name:<40}:    #calls = {stats['calls']:>7},    run time = {stats['total_time']:>12.6f}")
-    if not at_least_one_call:
-        print("No HiPOP functions were called.")