Linux - GeneralThis Linux forum is for general Linux questions and discussion.
If it is Linux Related and doesn't seem to fit in any other forum then this is the place.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
I have maed a dijkstra implementation with a fibonacci heap priority queue. In case of small inputs its working fine but if the graph is large (5000 vertices) then am getting the error:
I know there's nothing wrong here as it is working for less number of nodes. I am using a sparse graph representation. So i don't think memory should be a problem. Its not my code that's causing trouble!!!
This comes up right in the begining! Right before any de-allocation. The first node getting allocated for the heap. Before this, structure for the graph is allocated. I'll try the lib u suggested. Thnx
Maybe there's something wrong with your graph structure allocation (or any previous code) then.
Can you verify -via your debugger- that the memory pointers (ie for nodes & graph structure) are valid and that memory is allocated?
I still think that Valgrind is your best bet,although linking in with electric fence(a.k.a duma) should do the job too I guess.As timmeke pointed out looks like its the preceeding code which is corrupting your memory so you need to try and catch(duma) or record (valgrind) the problem earlier.
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.