[igraph] Utilizing previous calculations for performance
From:
Chris Wj
Subject:
[igraph] Utilizing previous calculations for performance
Date:
Sat, 24 Jan 2009 17:39:17 -0500
This is just a thought on performance for graph data structures...
Are there algorithms that would benefit from the calculations already made on a graph? For example, if you calculated a shortest path for a set of vertices, you may not need to calculate them again when you call a betweenness function. Of course, upon graph change/alteration, you would have to reset everything as the calculations would be invalid. Also, this type of model would require more memory for keeping the additional information around. Thoughts?