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	1883	January 31, 2019
Inefficiency of add_edge! in SimpleWeightedGraphs New to Julia	7	1311	June 22, 2020
Retworkx: new, high-performance Python graph library Graphs graphs	14	5612	November 13, 2021
Networkx & lightgraphs.jl shortest path benchmark Graphs question , package , lightgraphs	7	4176	May 11, 2020
Creating a Weighted Graph Graphs lightgraphs , graphs	33	6250	June 16, 2020