登录
首页 » Visual C++ » floy

floy

于 2007-11-13 发布 文件大小:252KB
0 165
下载积分: 1 下载次数: 280

代码说明:

  floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Dijkstra
    主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
    2010-09-25 17:37:40下载
    积分:1
  • library
    纯C语言编程的模拟现有图书馆的借阅、续借、归还;图书入库、出库;查询、排序等功能,实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询,排序功能有六种,界面可变色,里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
    2020-10-30 14:59:57下载
    积分:1
  • migong
    迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
    2011-06-11 17:13:39下载
    积分:1
  • 2007327
    带权有向以及无向图的各种操作,适合数据结构初学者使用,是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
    2007-04-22 23:49:54下载
    积分:1
  • codes
    数据结构相关代码,源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))
    2008-05-23 02:41:54下载
    积分:1
  • huisuo
    实现回溯算法,能解决八皇后问题等~~算法结果优化,时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
    2011-12-14 11:59:39下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • prim
    普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
    2012-05-17 09:11:15下载
    积分:1
  • K_Merge
    文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
    2010-08-03 10:24:48下载
    积分:1
  • Data-structure
    数据结构的一些简单的排序算法,有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)
    2016-06-28 08:27:32下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载