* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
-#include <stdio.h>
+
+#include <config.h>
+
#include <stdlib.h>
#include "as.h"
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_merge.c 1.2 11/13/90";
-#endif /* not lint */
-
/*
* Merge neighbors into queue, keeping it sorted. "neighbors" is sorted,
* both by lower bound cost and then by secondary cost.
np->step++;
}
- return (head);
+ return head;
}