Re: Graphs: Arbitrary Dijkstra's algorithm implementation

[Fabio Miranda Hamburger <fabmirha@ns.isi.ulatina.ac.cr>]

HI Glynn.

I thought You were out of linux-c-programming.

> > im a beginner here so please say if i do something off
> > topic.
> > i tried to set
> > #define     NODES   8
> > and then(i hope this is right) i changed the
> > constructor:
> > grafo(void) //inicializa la matriz de costos y los
> > > vectores temporales
> > >   {
> > >       //for (int i=1; i<=7; i++) was
> > > 	 //for (int j=1; j<=7; j++)
> > now
> >        for (int i=1; i<=NODES; i++) was
> >  	for (int j=1; j<=NODES; j++)
> >  	  costos[i][j]=10000;

> If costos has dimensions costos[NODES][NODES], the above is invalid;
> when i == NODES or j == NODES, you are exceeding the bounds of the
> array. If an array has size N, the valid indices range from 0 to N-1
> inclusive; N isn't a valid index

Fixed.
Still not working.