Search - graph - CodeBus

Search - graph - List

[MPI] bingchaji DL : 0: 树结构实现得并查集数据结构，用来求无向图的最小生成树。具有较高价值!值得使用-Tree structure and the realization of a search set data structure, used for undirected graph of the minimum spanning tree. Have a higher value! Worth using
Date : 2026-01-01 Size : 5kb User : 罗瑞海
[MPI] Smith DL : 0: smith圆图的matlab实现,快速解决一些电阻电容方面的计算-smith circle graph matlab achieve rapid solution to some aspects of resistance capacitance calculation
Date : 2026-01-01 Size : 20kb User : 李剑侠
[MPI] top_graf DL : 0: A graph topology in a paralel computing
Date : 2026-01-01 Size : 1kb User : gabi4488
[MPI] Assignment_03_6.3.3.c DL : 0: this the rank sort algorithm for mpi platform-this is the rank sort algorithm for mpi platform
Date : 2026-01-01 Size : 1kb User : Pavlos Kalogian
[MPI] 43 DL : 0: 连通图算法程序，研究这方面的人可以参考一下-Connected graph algorithm program, research in this area can refer to
Date : 2026-01-01 Size : 4kb User : jack
[MPI] linjiejuzheng DL : 0: 邻接矩阵邻接矩阵（Adjacency Matrix）：是表示顶点之间相邻关系的矩阵。设G=(V,E)是一个图，其中V={v1,v2,…,vn}。-Adjacency matrix adjacency matrix (Adjacency Matrix): is the relationship between the vertex between the adjacent matrix. Let G = (V, E) be a graph, where V = {v1, v2, ..., vn}.
Date : 2026-01-01 Size : 3kb User : wangmingmin
[MPI] nabbit_v1.tar DL : 0: 任何形式的任务并行依赖图都可以获得，有篇这个源代码的论文-Any form of task parallelism to the dependence graph can be obtained
Date : 2026-01-01 Size : 71kb User : storm
[MPI] nabbit_arrays_v1.tar DL : 0: 任何形式的任务并行依赖图都可以获得，有篇这个源代码的论文，这个是矩阵的-Task parallelism of any form of dependence graph can be obtained, the articles of this source of paper, this is the matrix
Date : 2026-01-01 Size : 21kb User : storm
[MPI] find_pi_mpi DL : 0: calculate pi by couting dots in x,y graph using mpi
Date : 2026-01-01 Size : 48kb User : alex
[MPI] mpegraph DL : 0: Graph in MPI execute it on linux. using mpi-Graph in MPI execute it on linux. using mpicc
Date : 2026-01-01 Size : 2kb User : shreyansh
[MPI] tuopupaixu DL : 0: 输出一个有向无环图（DAG）的拓扑排序。通过计算各顶点的入度数，删除入度为零的顶点，同时将该顶点指向的点的入度减一。重复此操作直到所有点都被输出。-Output a directed acyclic graph (DAG) topological sort. Through calculating the degree of each vertex deleting zero vertices into degrees, at the same time the vertex point to point into the degree of minus one. Repeat this action until all points have been output.
Date : 2026-01-01 Size : 239kb User : 李阳
[MPI] graph_isomorphism DL : 0: 图同构算法的并行实现,把原有的串行算法进行并行加速，大大地提高了效率-Parallel graph isomorphic algorithm, the original serial algorithm for parallel acceleration, greatly improving the efficiency
Date : 2026-01-01 Size : 75kb User : 田嘉宁
[MPI] NodeColoringTabu DL : 0: 在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn
Date : 2026-01-01 Size : 170kb User : 赵广
[MPI] graphmin DL : 0: 求图最小点，给定一个联通量。求最小节点，具体过程有注释-graph minimum
Date : 2026-01-01 Size : 2kb User : 张晓玲
[MPI] Finding_path DL : 0: 求图中任意两点之间的最短路径，需要输入邻接矩阵！-searching for the shortest path between any two nodes in a graph with the neighbor matrix given as input!
Date : 2026-01-01 Size : 4.68mb User : 洛龙
[MPI] diameter_basic_GraphChi DL : 0: 使用GraphChi计算图直径的估值。方法是Magnien 等人提出的 Double Sweep 算法，即两次BFS算法，一次向前一次向后。-Diameter valuation of a Graph using GraphChi framework. Using the method of Double Sweep that Magnien proposed, which is two bfs process.
Date : 2026-01-01 Size : 2kb User : 张任
[MPI] Drawing-of-some-special-graphs DL : 0: 三维曲线图、图形的隐藏属性、PEAKS函数曲线-The hidden attribute of 3D graph and graph, the curve of PEAKS function
Date : 2026-01-01 Size : 1kb User : zhangsongbo