0

I run the Dijkstra source-target shortest path algorithm in Neo4j (community edition) for 7 different graphs. The sizes of these graphs are as follows: 6,301 nodes - 8,846 nodes - 10,876 nodes - 22,687 nodes - 26,518 nodes - 36,682 nodes - 62,586 nodes.

For all these graphs, the results (the path) are received in 2 ms and completed at different amounts of times. Is it OK that the time is the same for all these graphs regardless of their sizes? The same is happening when running the Yen algorithm.

If the time provided by the Neo4j browser is inaccurate, how can I measure the execution time accurately?

Update (tracking the execution time):

Time

Thanks in advance.

3
  • @tomaz Bwratanic Commented Nov 3, 2022 at 9:35
  • 1
    How do you track the execution time? Commented Nov 3, 2022 at 19:23
  • I updated the question about how to track the execution time. Is it beneficial to use the enterprise edition to get the query log which contains timing info? Commented Nov 4, 2022 at 15:31

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.