wangkuiwu / datastructs_and_algorithm Goto Github PK

View Code? Open in Web Editor NEW

955.0 59.0 767.0 16.21 MB

Data struct and algorithm introduction and implementation in C/C++/Java.

C 44.59% C++ 23.88% Java 31.25% Objective-C 0.28%

datastructs_and_algorithm's Introduction

数据结构和算法的详细介绍(图片+文字详细说明)，请参考"wangkuiwu的博客"

datastructs_and_algorithm's People

Contributors

Stargazers

Watchers

Forkers

aquarius20th tomhua xiaolong1010 guoweihdu dirsystem zhaozilong52888 dawnminghuang doodlesomething harryprince dongnizh srz01 2015github mathisonqin waytai wujunsoftsys thu gin077 slobberydeadpunk cwei83 lpyjsj weifeng10086 hwm18 zhoujianqiu cap0dom stone12345 kuiwang pandazheng danny200309 dwlinux iscenery hearooo blizhan xiaobingbenyu frandavid guker wuchunhui weizhengwei jaminp guohuanyu moye fw1121 yagamilight1412 sasa233 aninam elviskwok noisebai zhaogang1993 ricezhang wpliuping12 alvis-yuan jiaming-shi adamzhz ginnz liwubj mnzero emuxevans huagsan qazx84265 bridsj taiyangyuqq coolbole zhujl99 leckie711 yw19920110 vanpersie32 picctree hcodercui jaydenwe dzlin yaoxiaokui shiweixian2 chzhewl yanzhichao ligerendaqiu jingdq wenbo2018 zhoutanxin sawcao teenyboy kay1994 damon-wang93 linccy liuyuan27 hzgcoding xdlwd086 zhanglifeng1 aimreant idevede smartliby seapub enigma-li oo7ww icyhearts yibinnn wentaowanna tscdong whucaichen terfil zrh091110225 flyxu

datastructs_and_algorithm's Issues

c语言版本的BFS

first_vertex和next_vertix找的节点有个条件：应该是没有被访问过的节点

无向图连接矩阵的最短路径中，prev的初始化应该是vs，而不是0。

Kruskal 算法中保存每个结点终点的数组大小初始化错误

datastructs_and_algorithm/source/graph/kruskal/udg/java/ListUDG.java

Line 373 in 61485e4

    
           int[] vends = new int[mEdgNum];     // 用于保存"已有最小生成树"中每个顶点在该最小树中的终点。

此数组初始化大小应该为顶点个数，而非边条数，因为在无向连通图中，边的条数最小可以为顶点个数减一（此时该无向连通图就是一棵树），故当一个无向连通图本身就是一棵树时，获取索引最大的顶点的终点，会有数组越界的异常。

并查集处理错误

在kruscal 算法当中博客写的是 “终点”这个不好理解的概念其实完全是博主坑爹自己创造的判断条件，此处应该使用并查集来确定是否成环。

在代码中博主写的是 vends[m]=n; 这个语句也不符合博主 ”终点“ 的定义，应该先判断m，n大小
if(m<n) swap(m,n)
vends[m]=n;
否则会造成一个边重复出现的错误下面是出现错误的测试用例：（出现了（0,1）（1,0））
int[] graph0 = new int[]{0, 10, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 11, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT};
int[] graph1 = new int[]{10, 0, 18, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 16, MAX_WEIGHT, 12};
int[] graph2 = new int[]{MAX_WEIGHT, 18, 0, 22, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 8};
int[] graph3 = new int[]{MAX_WEIGHT, MAX_WEIGHT, 22, 0, 20, MAX_WEIGHT, MAX_WEIGHT, 16, 21};
int[] graph4 = new int[]{MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 20, 0, 26, MAX_WEIGHT, 7, MAX_WEIGHT};
int[] graph5 = new int[]{11, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 26, 0, 17, MAX_WEIGHT, MAX_WEIGHT};
int[] graph6 = new int[]{MAX_WEIGHT, 16, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 17, 0, 19, MAX_WEIGHT};
int[] graph7 = new int[]{MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 16, 7, MAX_WEIGHT, 19, 0, MAX_WEIGHT};
int[] graph8 = new int[]{MAX_WEIGHT, 12, 8, 21, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, MAX_WEIGHT, 0};

    graph.matrix[0] = graph0;
    graph.matrix[1] = graph1;
    graph.matrix[2] = graph2;
    graph.matrix[3] = graph3;
    graph.matrix[4] = graph4;
    graph.matrix[5] = graph5;
    graph.matrix[6] = graph6;
    graph.matrix[7] = graph7;
    graph.matrix[8] = graph8;

wangkuiwu / datastructs_and_algorithm Goto Github PK

datastructs_and_algorithm's Introduction

datastructs_and_algorithm's People

Contributors

Stargazers

Watchers

Forkers

datastructs_and_algorithm's Issues

建议

请问一下

c语言版本的BFS

无向图连接矩阵的最短路径中，prev的初始化应该是vs，而不是0。

Kruskal 算法中保存每个结点终点的数组大小初始化错误

你的不能从任意一个结点进行遍历，我做了一些改动

并查集处理错误

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent