登录
首页 » 数据结构 » 图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到,构思巧妙 其算法思想在《算法设计与分析基础》...

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到,构思巧妙 其算法思想在《算法设计与分析基础》...

于 2022-07-01 发布 文件大小:3.17 kB
0 258
下载积分: 2 下载次数: 1

代码说明:

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到,构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

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

发表评论

0 个回复

  • Sales And Inventory
    这个系统将特别为那些初学者提供帮助。。
    2023-06-26 01:20:04下载
    积分:1
  • Description: Find a recursive practice basic operation list sort stack, queue da...
    内容简介: 查找 递归 链表基本操作练习 排序 栈、队列基本操作练习 数据结构讲义-Description: Find a recursive practice basic operation list sort stack, queue data structure to practice basic operation notes
    2022-02-05 23:37:42下载
    积分:1
  • 程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ,1≤i≤n 程序存储问题要求确定这n 个程序在磁带...
    程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ,1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案,使得能够在磁带上存储尽可能多的程序。 编程任务: 对于给定的n个程序存放在磁带上的长度,编程计算磁带上最多可以存储的程序数。 数据输入:由文件input.txt给出输入数据。第一行是正整数n,表示文件个数。接下来的1 行中,有n 个正整数,表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20
    2023-01-10 04:30:04下载
    积分:1
  • 库基础教程chm
    数据库基础教程chm-database based tutorial chm
    2022-01-26 06:00:30下载
    积分:1
  • 课程管理系统 适用于教师
    课程管理系统 适用于教师 -course management system applicable to teachers
    2022-01-25 14:30:21下载
    积分:1
  • 库设计指南
    数据库设计指南-60个设计技巧值得参考-Database Design Guide-60-design skills worthy of reference
    2022-01-26 03:07:31下载
    积分:1
  • huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压....
    huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压.-huffman tree realize. the use of statistics to read TXT file generated huffman tree, thus TXT file compression and decompression.
    2022-08-24 08:55:48下载
    积分:1
  • 这是一个演示系统,可以演示二叉树、二分查找等...
    这是一个数据结构演示系统,可以演示二叉树、二分查找等数据结构-This is a data structure presentation systems, you can demo binary tree, binary search data structure, etc.
    2022-01-30 10:23:29下载
    积分:1
  • Computes estimates for the number of fores ts of a graph. input as a 0
    Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
    2022-02-05 15:36:49下载
    积分:1
  • Hotel management program, mainly for small a la carte restaurant cash register,...
    酒店管理程序,主要用于小型饭店点菜收银,功能完备-Hotel management program, mainly for small a la carte restaurant cash register, a fully functioning
    2022-07-05 03:10:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载