[google-appengine] Re: how best to represent a directed graph w/ 25K nodes? (for path planning)

2008-12-28 Thread Amar Pai
So if I shard my graph into 3 parts, my main class can store them as class variables and they'll persist across requests? That would be great. But will I run into quota problems holding 3M data in memory? (Assuming low overhead otherwise, and only 100ish requests per day) Also, if I did it that

[google-appengine] Re: how best to represent a directed graph w/ 25K nodes? (for path planning)

2008-12-28 Thread Amar Pai
Symonds" wrote: > On Sat, Dec 27, 2008 at 5:16 AM, Amar Pai wrote: > > I have a route planning webapp, written in Python, that uses > > Djikstra's algorithm to find the shortest path between two nodes in a > > directedgraph.  I want to port this to AppEngine, but I'm

[google-appengine] how best to represent a directed graph w/ 25K nodes? (for path planning)

2008-12-27 Thread Amar Pai
Hi, I have a route planning webapp, written in Python, that uses Djikstra's algorithm to find the shortest path between two nodes in a directed graph. I want to port this to AppEngine, but I'm not sure how to represent the graph. Right now I'm using a dict of dict, G[pt] [pt] -> (edge data) whe