graph.h

typedef enum 
  { FALSE = 0,
    TRUE  = 1
  } BOOL;

typedef struct Node
  { long         id;
    struct Edge  *first_edge;
                 /* in list of incident edges */
    struct Edge  *scan_ptr;
                 /* next edge to be scanned when node 
                    will be visited again */
    struct Node  *parent;   /* pointer of Gomory-Hu cut tree */
    double       mincap;    /* capacity of minimum cut between
                               node and parent in GH cut tree */
      /* subsequent entries for use by maxflow */
    long         dist;
    double       excess;
    struct Node  *bfs_link;     /* for one way BFS working queue */
    struct Node  *stack_link;   /* for stack of active nodes */
    BOOL         alive;    
    BOOL         unmarked;      /* while BFS in progress */
  } node;

typedef struct Edge
  { node         *adjac; /* pointer to adjacent node */
    struct Edge  *next;  /* in incidence list of node 
                            from which edge is emanating */
    struct Edge  *back;  /* pointer to reverse edge */
    double       cap;
    double       rcap;   /* residual capacity */
  } edge;

typedef struct Graph
  { long    n_nodes;
    node    *nodes;
    long    n_edges;     /* number of edges with non-zero capacity */
    long    n_edges0;    /* number of all edges */
    edge    *edges;
  } graph;

#define  NILN (node *) 0
#define  NILE (edge *) 0
#define  EPS  1.0E-10

---