Home/ Questions/Q 3699388
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-19T05:05:48+00:00

I’m working on a academic project: writing a library for finding the shortest path

  • 0

I’m working on a academic project: writing a library for finding the shortest path on large, weighted, directed graphs.

Specifications are:

  • The example data set is a graph of 1500 vertices with an average of 5.68 edges per node. Specification may vary up to 20.000 nodes.

  • Moreover I’m working in a cpu / memory bound, environment: Android.

  • Edge weight is not trivial, nor costant. It depends on variable states of the graph.

  • We must work offline.

I face several difficulties:

  • I need an efficient way to store, retrive and update data of the graph. Should I use a SQLite object with queries from the Java classes, a large custom java object on the heap, or what? I think this is the most performance-critical aspect.

  • I need an efficient way to implement some kind of short path algorithm. Since all the weight are positive, should I apply the Dijikstra algorithm with an ArrayList as the container of the visited nodes?

  • Is this a good case to use the NDK? The task is CPU intensive, but it also make frequent access to the memory, so I don’t think so, but I’m open to contribution.

  • Always remember that resources are scarce, ram is insufficient, disk is slow, cpu is precious (battery – wise).

Any advice is wellcome, cheers 🙂

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    For these many nodes I would suggest to aquire some Cloud-computing service and let the android app communicate with it.
    How about Hadoop’s MapReduce on Amazon’s Cloud, there are many graph frameworks such as Mahout and it is really fast.
    And at least very scalable if there would be more nodes and edges.

    • 0