#include<iostream>
#include<stdlib.h>//产生随机数组?br />#include<time.h> //同上
#include<list>
{
public:
int m_beginVex;
int m_endVex;
int m_weight;
MyArc(int beginVex,int endVex,int weight);
MyArc(){}
bool operator < (const MyArc& arc)
{
return m_weight<arc.m_weight;
}
bool operator == (const MyArc& arc)
{
return m_weight==arc.m_weight;
}
bool operator > (const MyArc& arc)
{
return m_weight>arc.m_weight;
}
} ;
{}
//2) 表示囄L矩阵cGraph:
class Graph
{
public:
int m_vexnum;
int m_arcnum;
int *m_pmatrix;
public:
~Graph();
Graph(int vexnum);
Graph(int vexnum,int *pmatrix);
void insert(MyArc arc);//按权值大排序插?br /> bool bound(int x); //判断点x是否已与其它点q?br />};
//构造函?br />Graph::Graph(int vexnum)
{
m_pmatrix=new int[vexnum*vexnum];
m_vexnum=vexnum;m_arcnum=0;
for(int i=0;i<vexnum*vexnum;++i)
m_pmatrix[i]=0;
{
m_vexnum=vexnum;
// m_arcnum=arcnum;
m_pmatrix=new int[m_vexnum*m_vexnum];
for(int i=0;i<m_vexnum*m_vexnum;++i)
m_pmatrix[i]=pmatrix[i];
}
{
for(int i=0;i<m_vexnum;++i) if(m_pmatrix[x+i*m_vexnum]!=0) return true;
return false;
}
void Graph::insert(MyArc arc)
{
m_pmatrix[arc.m_beginVex*m_vexnum+arc.m_endVex]=arc.m_weight;
m_pmatrix[arc.m_endVex*m_vexnum+arc.m_beginVex]=arc.m_weight;
++m_arcnum;
}
//析构
Graph::~Graph()
{
delete[] m_pmatrix;
}
//3) 按权存储边的有序队列cMyQueues:
class MyQueues
{
public:
list<MyArc> m_list;
MyQueues(){}
void insert(const MyArc& arc);//Ҏ权值插入队列中合适位|?
void InsertGraph(const Graph &graph);//图的连通分量插入队?br /> MyArc pop();
};
//边出?br />MyArc MyQueues::pop()
{
MyArc arc=m_list.front();
m_list.pop_front();
return arc;
}
//Ҏ权值插入队列中合适位|?
void MyQueues::insert(const MyArc& arc)
{
list<MyArc>::iterator pos;
pos=m_list.begin();
while(pos!=m_list.end())
{
if(*pos>arc) break;
else ++pos;
}
m_list.insert(pos,arc);
}
//图的连通分量插入队?br />void MyQueues::InsertGraph(const Graph &graph)
{
for(int i=0;i<graph.m_vexnum;++i)
{
for(int j=i+1;j<graph.m_vexnum;++j)
if(graph.m_pmatrix[i*graph.m_vexnum+j]) insert(MyArc(i,j,graph.m_pmatrix[i*graph.m_vexnum+j]));
}
}
{
list<int> my_list;
my_list.push_back(arc.m_beginVex);
int *ps=new int[graph.m_vexnum];
for(int i=0;i<graph.m_vexnum;++i)
ps[i]=0;
while(!my_list.empty())
{
int x=my_list.front();
ps[x]=1;
my_list.pop_front();
for(int i=0;i<graph.m_vexnum;++i)
{
if(graph.m_pmatrix[i+x*graph.m_vexnum]!=0)
{
if(i==arc.m_endVex) return true;
if(ps[i]!=1) my_list.push_back(i);
}
}
}
delete[] ps;
return false;
}
//4) kruskal法:
void kruskal(const Graph& graph,Graph& smtree)
{
MyQueues arcqueues;//保存从小到大排列的边
arcqueues.InsertGraph(graph);
MyArc myarc;//Arc表示边的cd
int arcnum=0; //边的个数
while(arcnum<graph.m_vexnum-1)
{
myarc=arcqueues.pop();
if(!IsCycle(smtree,myarc))
{
smtree.insert(myarc);
++arcnum;
}
}
}
void SetMatrix(int vexnum,int *pmatrix)
{
srand((unsigned)time(NULL));
for(int i=0;i<vexnum;++i)//产生随机权值矩?br /> {
for(int j=i;j<vexnum;++j)
{
if(j==i)
{
pmatrix[i*vexnum+j]=0;
continue;
}
int rnum=rand();rnum%=99;rnum++;//产生1~99的随机整C的权?br /> pmatrix[i*vexnum+j]=rnum;
pmatrix[j*vexnum+i]=rnum;
}
}
cout<<"***随机产生的各Ҏ值矩?[点Cؓ "<<vexnum<<"] ****\n";
for(int i=0;i<vexnum;++i)//输出随机权值矩?br /> {
for(int j=0;j<vexnum;++j)
{
cout<<pmatrix[i*vexnum+j]<<"\t";
}
cout<<endl;
}
}
void SmallestTreeOutput(const Graph& smtree)
{
cout<<"最生成树:"<<endl;
for(int i=0;i<smtree.m_vexnum;++i)//输出最树
for(int j=i+1;j<smtree.m_vexnum;++j)
if(smtree.m_pmatrix[i*smtree.m_vexnum+j])
cout<<'('<<i<<','<<j<<','<<smtree.m_pmatrix[i*smtree.m_vexnum+j]<<')'<<endl;
}
void main()
{
char i;
cout<<"误入顶Ҏ?";
cin>>i;
int vex=i-'0';
int *matrix=new int[vex*vex];
cout<<endl;
SetMatrix(vex,matrix);
Graph graph(vex,matrix),smtree(vex);
kruskal(graph,smtree);
SmallestTreeOutput(smtree);
delete []matrix;
}
l果输出Q?br />误入顶Ҏ?6
***随机产生的各Ҏ值矩?[点Cؓ 6] ****
0 64 7 15 22 43
64 0 72 86 53 40
7 72 0 53 37 22
15 86 53 0 87 82
22 53 37 87 0 9
43 40 22 82 9 0
最生成树:
(0,2,7)
(0,3,15)
(0,4,22)
(1,5,40)
(4,5,9)
]]>
会蟩q空|制表W和换行W．下面是个例子Q?br />char1.cpp
/*C语言一个I/O问题E序*/
#include<stdio.h>
void display(char cr,int lines,int width);
int main(void)
{
int ch;
int rows,cols;
printf("Enter a character and tow integers:\n");
while((ch=getchar())!='\n')
{
scanf("%d %d",&rows,&cols);
display(ch,rows,cols);
printf("Enter another character and tow integers;\n");
printf("Enter a newline to quit.\n");
}
printf("Bye.\n");
return 0;
}
void display(char cr,int lines,int width)
{
int row ,col;
for(row =1;row<=lines;row++)
{
for(col=1;col<=width;col++)
{
putchar(cr);
}
putchar('\n');
}
}
l果输出Q?br />
Enter a character and tow integers:
d 3 2
dd
dd
dd
Enter another character and tow integers;
Enter a newline to quit.
Bye.
Press any key to continue...
可以看见紧跟?后面的那个换行符Qscanf()函数该换行W留在了输入队列中．而getchar()q不跌换行W，所以在循环?br />下一周期Q在你有Z输入其他内容之前Q这个换行符由getchar()dQ然后将其赋值给chQ而ch为换行符正是l止循环的条Ӟ
要解册个问题，必须跌一个输入周期中键入的最后一个数字与下一行开始处键入的字W之间的所有换行符或空|
改进如下Q?strong>char2.cpp
/*C语言一个I/O问题E序修改版本*/
#include<stdio.h>
void display(char cr,int lines,int width);
int main(void)
{
int ch;
int rows,cols;
printf("Enter a character and tow integers:\n");
while((ch=getchar())!='\n')
{
if( scanf("%d %d",&rows,&cols)!=2)
break;
display(ch,rows,cols);
while(getchar()!='\n') /*剔除掉scanf()输入后的所有字W．*/
{
printf("1"); /*后面有多字W就输出多少?*/
continue;
}
printf("Enter another character and tow integers;\n");
printf("Enter a newline to quit.\n");
}
printf("Bye.\n");
return 0;
}
void display(char cr,int lines,int width)
{
int row ,col;
for(row =1;row<=lines;row++)
{
for(col=1;col<=width;col++)
{
putchar(cr);
}
putchar('\n');
}
}
输出l果Q?br />Enter a character and tow integers:
d 3 4
dddd
dddd
dddd
Enter another character and tow integers;
Enter a newline to quit.
d 3 4
dddd
dddd
dddd
11Enter another character and tow integers;
Enter a newline to quit.
]]>
设计q实现魔王语a的解释器Q具体要求如下：大写字母表示王语言的词汇；写字母表示人的词汇语言Q魔王语a中可包含括号?/font>
如：我们有魔王语a的解释规则：BQ?gt;tAdAQA->saeQ则王语言 B(ehnxgz)B解释成tsaedsaeezegexenehetsaedsae?br />
实现代码如下Q?br />
#include<stdlib.h>
#include<stdio.h>
#define STACK_INIT_SIZE 100 //存储I间初始分配?br />#define STACK_INCREMENT 10 //存储I间分配增量
#define OVERFLOW 1
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef char SElemType;
typedef char QElemType;
typedef int Status;
typedef struct{
SElemType *base; //栈基址
SElemType *top; //栈顶地址
int stacksize;
}SqStack;
typedef struct QNode{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr front; //队头指针
QueuePtr rear; //队尾指针
}LinkQueue;
Status InitStack(SqStack &S)
//构造一个空?br />{
S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(char));
if(!S.base)
exit (OVERFLOW);//存储单元分配p|
S.top=S.base;
S.stacksize=STACK_INIT_SIZE;
return OK;
}
Status Push(SqStack &S,SElemType e)
//插入元素e栈顶单元
{
if(S.top-S.base>=S.stacksize)
{//栈满Q追加存储空?br /> S.base=(SElemType *)realloc(S.base,(S.stacksize+STACK_INCREMENT)*sizeof(char));
if(!S.base)
exit (OVERFLOW);//存储单元分配p|
S.top=S.base+S.stacksize;
S.stacksize+=STACK_INCREMENT;
}
*(S.top)=e;
S.top++;
return OK;
}
Status Pop(SqStack &S,SElemType& e)
//若栈不ؓI，则删除S的栈单元，用eq回其?br />{
if(S.base==S.top)
return ERROR;
S.top--;
e=*(S.top);
return OK;
}
Status StackEmpty(SqStack S)
{
if(S.base==S.top)
return 0;
else
return 1;
}
Status InitQueue(LinkQueue &Q)
//构造一个空队列Q
{
Q.front=Q.rear=(QueuePtr)malloc(sizeof (QNode));
if(!Q.front)
exit (OVERFLOW);
Q.front->next=NULL;
return OK;
}
Status EnQueue (LinkQueue&Q,QElemType e)
//插入元素e为Q的新的队օ?br />{
QueuePtr p;
p=(QueuePtr)malloc(sizeof (QNode));
p->data=e;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
return OK;
}
Status DeQueue (LinkQueue &Q,QElemType &e)
//若队列不I，则删除Q的队头元素，用eq回其|q返回OK;
//否则q回ERROR
{
QueuePtr p;
if(Q.front==Q.rear)
return ERROR;
p=Q.front->next;
e=p->data;
Q.front->next=p->next;
if(p==Q.rear)
Q.rear=Q.front;
free(p);
return OK;
}
Status QueueEmpty(LinkQueue Q)
//若队列Q为空队列,则返回TRUEQ否则返回FALSE
{
if(Q.rear==Q.front)
return FALSE;
else
return TRUE;
}
void InStack(char fiend[],SqStack &S)
{
int m,i=0;
for(;fiend[i]!='\0';i++);//计算fiend中有多少
for(m=i-1;m>=0;m--)
Push(S,fiend[m]);
}
void main()
{
char e,c,d;
SqStack S,zhan;
LinkQueue Q;
InitQueue(Q);
char mowang[]="B(ehnxgz)B";
printf("你想要解释的王语言为：%s\n",mowang);
char B[]="tAdA";
InitStack(S);
InitStack(zhan);
InStack(mowang,S);//全部压进栈中
while(StackEmpty(S))//在栈不ؓI的情况?br /> {
Pop(S,e);
if(e=='B')
InStack(B,zhan);
else
if(e=='(')//如果为右括号Q则输出括号中所有内?br /> {
while(Pop(S,e)&&e!=')')//当ؓ左括h停止
{
if(e!=')')
EnQueue (Q,e);
}
DeQueue (Q,c);//d队列中第一个元?br /> while(QueueEmpty(Q))
{
DeQueue (Q,d);//取出元素
Push(zhan,c);
Push(zhan,d);
}
Push(zhan,c);//再次压入W一个元?br /> // Pop(S,e);//L左括?br /> }
}
printf("\n解释的结果ؓ: ");
while(StackEmpty(zhan))//在栈不ؓI的情况?br /> {
Pop(zhan,c);
if(c=='A')
printf("sae");
else
printf("%c",c);
}
printf("\n");
}
]]>
ADT complex{
数据对象Q?/span> D={ c1,c2 c1,c2 ?/span> FloatSet }
数据关系Q?/span> R={ <c1,c2> c1 c2 }
基本操作Q创Z个复数 creat(a);
输出一个复数 outputc(a);
求两个复数相加之和 add(a,b);
求两个复数相减之差 sub(a,b);
求两个复数相乘之U chengji(a,b);
{等 ;
} ADT complex;
实现复数 ADT 可以使用面向q程的程序设计方法，也可以用面向对象E序设计Ҏ?br />[复数ADT实现的面向过E?/span>C语言源程?/span>]-complex.h
#include <stdio.h>
#include <stdlib.h>
typedef struct Complex
{
float real;
float image;
}Complex;
void CreatComplex(Complex& c,float a,float b);
void AddComplex(Complex& sum,Complex c1,Complex c2 );
void Subtract_C(Complex& Sub,Complex c1,Complex c2 );
void Multiple_C(Complex& product,Complex c1,Complex c2 );
void Print_C(Complex c);
void CreatComplex(Complex& c,float a,float b)
{
c.real = a;
c.image = b;
}
void AddComplex(Complex& sum,Complex c1,Complex c2)
{
sum.real = c1.real + c2.real ;
sum.image = c1.image + c2.image ;
}
void Subtract_C(Complex& Sub,Complex c1,Complex c2 )
{
Sub.real = c1.real -c2.real ;
Sub.image = c1.image - c2.image ;
}
void Multiple_C(Complex& product,Complex c1,Complex c2 )
{
product.real = c1.real * c2.real - c1.image * c2.image ;
product.image = c1.real * c2.image + c1.image * c2.real ;
}
void Print_C(Complex c)
{
if (c.image == 0.0)
printf("%5.2f\n",c.real );
else
printf("%5.2f+%5.2fi\n",c.real ,c.image );
if(c.real==0.0)
printf("%5.2fi\n",c.image);
}
complex.cpp代码Q?br />#include "complex.h"
#include <stdio.h>
void main()
{
float a,b,c,d;
Complex c1,c2,sum,Sub,Prod;
scanf("%f%f%f%f",&a,&b,&c,&d);
CreatComplex(c1,a,b);
Print_C(c1);
CreatComplex(c2,c,d);
Print_C(c2);
AddComplex(sum,c1,c2);
Print_C(sum);
Subtract_C(Sub,c1,c2);
Print_C(Sub);
Multiple_C(Prod,c1,c2);
Print_C(Prod);
}
]]>