|  | the best data structure |  | |
| | | Guest |  |
| Posted: Wed Aug 27, 2008 1:50 pm Post subject: the best data structure |  |
Suppose you have a lot of different networks of cities where the same city can be a member of more than one network. What would be a superior data storage structure then a :
typedef map<const city*, int > _Distance; typedef map<const city*, _Distance> Graph_t
where city is data structure representing a city ? |
| |
| | | Gene |  |
| Posted: Wed Aug 27, 2008 11:30 pm Post subject: Re: the best data structure |  |
On Aug 27, 9:50 am, danijel.mand...@gmail.com wrote:
| Quote: | Suppose you have a lot of different networks of cities where the same city can be a member of more than one network. What would be a superior data storage structure then a :
typedef map<const city*, int > _Distance; typedef map<const city*, _Distance> Graph_t
where city is data structure representing a city ?
|
You haven't provided enough information to answer the question. Data structures only have relative values in the context of the operations to be performed on them. Any data structures textbook will give you lots of insight on different graph representations, each of which makes most sense in a different context. |
| |
|
|