🚀 go-pugleaf

I have code similar to the following(everything's declared, etc):

int foo(graph &G, node_array<double> cost, node_array<node) pred ...)
{

node_pq<double> Q(G);
forall_nodes(n,G) Q.insert(n,cost[n]);

while(!Q.empty()){
  n = Q.del_min();
  if(n){
    forall_adj_nodes(n1,n){
	if(Q.member(n1){
	  cout << index(n1) << " ";
   	  pred[n1] = n;
          ....other stuff.....
	}
    }
  }
}
}

if I pass this function a graph with nodes {a, b, c, d}
where cost[a]<cost[b]<...<cost[d], the a is the minimum
on the first pass, and should be deleted from the node
priority queue Q.  However, "a" shows up as a member of
Q on the next pass (and causes a bus error). "a" is 
assigned to "n" on the first pass.  

Any ideas why?  Any fixes?

Dave  (using LEDA 3.1.2)
--
-----------------------------------------------------------------------
		   Georgia Institute of Technology
      School of Electrical Engineering, Atlanta, GA  30332-0250
		    E-MAIL: scruggs@eecom.gatech.edu
			PHONE: (404) 894-2955