ok i have this astar search code which is pretty big...in some cases i get a segmentation fault and in others everything runs just fine...the weird thing is that the segmentation fault only occurs if i run this using g++ on unix...borland C++ never gave me a segmentation fault...
i'll attach the .cpp file here for borland C++ but if noone looks at it, can you tell me which operations would likely cause this segmentation fault...since the code is so big i don't really know where to look for the problem...and this is worsened by the fact that everything ran just fine in borland c++...except i used to get a warning that i'm comparing signed and unsigned variables someplace...but i don't think tat's related to this...
anyway here are some areas:
- i use a map to store nodes...
- i use lots of strings in the code e.g. in the node class to check for node names...
- i have a vector of strings in the code as well which i define as:
vector<string> CityConnections...
- i don't use any sort of array in the code...
Regards,
Farooq
