eyan422的专栏

<br />#include <iostream> using namespace std; const int n = 4; int x[n]; char str[n][50] = {'id','name','sex','age'}; //回溯法 void backtrack(int t) { if(t >= n) { for(int i = 0; i < n; i++) cout<<x[i]; cou

//path记录上一个节点# include # include # define maxlen 10# define large 999typedef struct{    int vexnum;    char vexs[maxlen];    int arcs[maxlen][maxlen];}graph;void init_graph(graph *g){    int i = 0,j = 0;    g -> vexnum = 5;    for(i = 0; i         for(j =

#include #include #include "4.h" /* typedef struct node {     int data;     struct node *next; }node,*link; */ void ListIni(link *list) { *list = (link)malloc(sizeof(node)); if(!(*list))

#include #include typedef struct node { int data; struct node * next; }Node,*link; void InitList(link * list) { (*list) = (link)malloc(sizeof(Node)); if(!(*list)) { exit(-1); } (*list)->d

#include #include typedef struct node { int data; struct node *next; }node,*link; void ListIni(link *list) { *list = (link)malloc(sizeof(node)); if(!(*list)) { exit(-1); } (*list)->data =

#include #include typedef struct node { int data; struct node*next, *prior; }node,*link; void ListIni(link *list) { *list = (link)malloc(sizeof(node)); if(*list) { exit(-1); } (*list)->da

#include #include typedef struct node { struct node *next; int data; }node,*link,*position; typedef struct linklist { link head, tail; int len; }linklist; void MakeNode(link *p,int e) { *p =