![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C
文章平均质量分 52
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原创 2010-10-14 00:19:00 · 726 阅读 · 0 评论 -
dijkstra最短路径算法C实现
//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 =转载 2010-11-09 12:20:00 · 540 阅读 · 0 评论 -
带头结点的链表
#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))原创 2011-11-15 16:41:08 · 295 阅读 · 0 评论 -
带头结点的循环链表基本操作
#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原创 2011-11-14 15:50:16 · 454 阅读 · 0 评论 -
带尾节点的循环链表基本操作
#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 =原创 2011-11-18 14:43:30 · 1014 阅读 · 1 评论 -
带头结点的双向循环链表
#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原创 2011-11-18 16:25:34 · 1096 阅读 · 0 评论 -
实用链表(待续)
#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 =原创 2011-11-19 17:14:53 · 293 阅读 · 0 评论