mynode.h

图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph＝( V, E ).使用拓扑排序的算法.

#ifndef _MYNODE_H
#define _MYNODE_H
#define MAXQUEUE 1000
/* Define node and node_ptr type */
typedef struct node *node_ptr;
struct node
{
   int to_vertex;
   node_ptr next;
};
/* Function to create an empty list */
node_ptr create(void);
/* Function to return dynamically allocated memory in list */
void destroy(node_ptr list);
/* Function to insert n at front of list */
void insert_at_front(int n, node_ptr list);
/* Function to print list */
void print(node_ptr list);
/* Function to insert n in (non-decreasing) order in list - assuming list items are already in (non-decreasing) order. */
void insert_in_order_node(int n, node_ptr list);
#endif