https://stackoverflow.com/questions/49183518/independent-paths-of-power-number

Member Avatar
Member Avatar
-3 forum 5

I am working on a mapping system to support pathfinding over areas that are too large to hold in memory. The problem i have run into is how to load only a small part of the map when its all linked together and then dynamicaly load more of the map when it is needed and dump unnecessary pieces to disk. I was thinking I could use seralization to save the objects to disk only problem i have is they are all linked together multiple times and im not sure how to keep track of which links need to be updated …

Member Avatar
Member Avatar
+0 forum 5

Ok so im working on a mapping library for my pathfinding system and im trying to figure out what Data structure would be best to use for rapid calls up to several hundred a second, as low memory usage as possible, and not too difficult to store and load pieces(chunks) of the map from a sql relational database. Here is the scenario: * The map is devided up into sections called chunks for lack of a better term. Each chunk is connected by any number of links to its neighboring chunks if there is a way to walk from one …

Member Avatar
Member Avatar
+0 forum 2

The End.