I’m building a directed graph of possible game scores from (0,0) up to a score of N, together with a dictionary pointing from the score to the corresponding node. I’d like to make it as efficient as possible. Currently for N = 1000 it’s taking about 1.8s to run on my i7-8550U (1.8GHz) machine. I’d…

Performance: Building directed graph of game scores (0,0) -> (0,1) etc

gabiteodoru June 26, 2019, 9:56pm 5

Hm I’ve translated to C++ and only got a 50% speed boost, I guess my Julia code should be OK then? …

Topic		Replies	Views
Trying to identify possible optimizations (or errors) in a graph algorithm Graphs lightgraphs	24	1845	January 31, 2019
Graphs, k-centers and recursion Graphs graphs	6	843	June 10, 2018
Inefficiency of add_edge! in SimpleWeightedGraphs New to Julia	7	1295	June 22, 2020
Networks' Simulation Performance	7	1208	May 21, 2019
Suggestions for performance enhancement in LightGraphs `diffusion`? General Usage question , package	8	1031	August 22, 2017