jQuery火箭图标返回顶部代码

算法解析(图片内容来自《大话数据结构》这本书不错哦):

代码如下:

#include "stdafx.h"
#include<iostream>
#include<string>
using namespace std;
#define MAXSIZE 100
#define ERROR 0
#define OK 1
#define INFINITY 65535
typedef int Status;
typedef struct ArcNode                 //边表结点
{
    int adjvex;                        //改变所指向的顶点的位置
    struct ArcNode *nextarc;           //指向下一条边的指针    
}ArcNode;
typedef struct VNode                   //顶点表结点
{
    int in;
    char data;                         //顶点域，存储顶点信息
    ArcNode *firstarc;                 //指向第一条依附该顶点的边的指针
}VNode, AdjList[MAXSIZE];              //AdList表示邻接表类型
typedef struct                         //邻接表
{
    AdjList vertices;
    int vexnum, arcnum;                //图的当前顶点数和边数
}ALGraph;

typedef struct
{
    char vexs[MAXSIZE];                //顶点表
    int arcs[MAXSIZE][MAXSIZE];        //邻接矩阵
    int vexnum, arcnum;                //图的当前点数和边数
}AMGraph;

void CreateUDN(AMGraph &G)             //采用邻接矩阵表示法，创建无向网&G
{
    int i, j, w;
    cout << "请输入总顶点数、总边数(空格隔开):" << endl;
    cin >> G.vexnum >> G.arcnum;       //输入总顶点数、总边数
    cout << "请输入顶点信息(空格隔开):" << endl;
    for (i = 0; i < G.vexnum; i++)     //依次输入点的信息
    {
        cin >> G.vexs[i];
    }
    for (i = 0; i < G.vexnum; i++)     //初始化邻接矩阵，编的权值均为极大值MaxInt
        for (j = 0; j < G.vexnum; j++)
            G.arcs[i][j] = 0;
    cout << "请输入边的信息(输入顺序：连接点1编号，连接点2编号):" << endl;
    for (int k = 0; k < G.arcnum; k++) //构造邻接矩阵
    {
        cin >> i >> j;                 //输入一条边依附的顶点
        G.arcs[i-1][j-1] = 1;
    }
}

void CreateALGraph(AMGraph G, ALGraph &GL)
{
    int i, j;
    ArcNode *e;
    GL.vexnum = G.vexnum;
    GL.arcnum = G.arcnum;
    for (i = 0; i <G.vexnum; i++)      //读入顶点信息，建立顶点表
    {
        GL.vertices[i].in = 0;
        GL.vertices[i].data = G.vexs[i];
        GL.vertices[i].firstarc = NULL;//将边表置为空表
    }

    for (i = 0; i<G.vexnum; i++)       //建立边表
    {
        for (j = 0; j<G.vexnum; j++)
        {
            if (G.arcs[i][j] == 1)
            {
                e = new ArcNode;
                e->adjvex = j;           //邻接序号为j
                e->nextarc = GL.vertices[i].firstarc;//将当前顶点上的指向的结点指针赋值给e
                GL.vertices[i].firstarc = e;//将当前顶点的指针指向e
                GL.vertices[j].in++;
            }
        }
    }
}

Status TopologicalSort(ALGraph GL)
{
    ArcNode *e;
    int i, k, gettop;
    int top = 0;                       //用于栈指针下标
    int count = 0;                     // 用于统计输出顶点的个数
    int *stack;                        //建栈将入度为0的顶点入栈
    stack = new int[GL.vexnum];
    for (i = 0; i<GL.vexnum; i++)
        if (0 == GL.vertices[i].in)    //将入度为0的顶点入栈
            stack[++top] = i;
    while (top != 0)
    {
        gettop = stack[top--];
        cout << GL.vertices[gettop].data<<"->"; 
        count++;                       //输出i号顶点，并计数
        for (e = GL.vertices[gettop].firstarc; e; e = e->nextarc)
        {
            k = e->adjvex;
            if (!(--GL.vertices[k].in)) //将i号顶点的邻接点的入度减1，如果减1后为0，则入栈
                stack[++top] = k;
        }
    }
    cout << endl;
    if (count <GL.vexnum)
        return ERROR;
    else
        return OK;
}

int main()
{
    AMGraph G;
    ALGraph GL;
    int result;
    CreateUDN(G);
    CreateALGraph(G,GL);
    result = TopologicalSort(GL);
    cout << "result:" << result << endl;
    return 0;
}

示例结果(就是上面那几张图片的示例):