harmodrew
11th August 2010, 01:04
Hello!
My program behaves in a very strange way! When I run it in debug step-by-step mode all goes good but when I run it in "normal" mode it raises a segmentation error around a dynamically allocated vector! As I said this error doesn't come up while debugging...
Here is the link to the project (I've uploaded it to mediafire) http://www.mediafire.com/?vbwre2a73vl8ju9
This program simply has to find a path between two nodes of a graph.
Starting from the node 0 (first row of the adjacency matrix) it inspects all the nodes searching for the first uninspected node which is the end node (fourth row).
I've posted a light version of the project with only the necessary to raise up the segmentation fault (infact it is a fixed graph, etc...)
Ask me if you need more info :)
thanks a lot
My program behaves in a very strange way! When I run it in debug step-by-step mode all goes good but when I run it in "normal" mode it raises a segmentation error around a dynamically allocated vector! As I said this error doesn't come up while debugging...
Here is the link to the project (I've uploaded it to mediafire) http://www.mediafire.com/?vbwre2a73vl8ju9
This program simply has to find a path between two nodes of a graph.
Starting from the node 0 (first row of the adjacency matrix) it inspects all the nodes searching for the first uninspected node which is the end node (fourth row).
I've posted a light version of the project with only the necessary to raise up the segmentation fault (infact it is a fixed graph, etc...)
Ask me if you need more info :)
thanks a lot