Related to #1785.
/* Priority Queue Code for shortest path in graph */
-#include <sgraph.h>
+#include <ortho/sgraph.h>
/* typedef snode** PQ; */
#define N_VAL(n) (n)->n_val
#ifndef MAZE_H
#define MAZE_H
-#include <sgraph.h>
+#include <ortho/sgraph.h>
enum {M_RIGHT=0, M_TOP, M_LEFT, M_BOTTOM};
#ifndef PARTITION_H
#define PARTITION_H
-#include <maze.h>
+#include <ortho/maze.h>
extern boxf* partition (cell*, int, int*, boxf);
#ifndef SEARCH_G_H
#define SEARCH_G_H
-#include "structures.h"
+#include <ortho/structures.h>
typedef struct snode snode;
typedef struct sedge sedge;
#include "types.h"
#include "cgraph.h"
-#include "rawgraph.h"
+#include <ortho/rawgraph.h>
typedef struct {
double p1, p2;