Hi, I have to implement a graph as a adjacent matrix for my algorithms & data structure course and almost everything works correct besides method given below. The method should removes given vertex from the graph and all the edges containing it.
Returns: 0 if no error occurs or -1 otherwise
It does not produce the proper output(does not remove the given vertex and edges). I even draw and analize this step by step on a paper and I thing there is a problem with the part
but I am not sure that this is the problem, maybe it is somewhere else. Please help me with this.
|All times are GMT +5.5. The time now is 02:37.|