Search - acm h - CodeBus

Search - acm h - List

[Other resource] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM / Illinois prepared to contest the information, because the competition for high speed
Date : 2008-10-13 Size : 9.96kb User : 罗鹏魁
[Fractal program] work2z DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM / ICPC contest and the preparation of information, because the competit
Date : 2008-10-13 Size : 4.17kb User : kelly
[Mathimatics-Numerical algorithms] Hroad DL : 0: ACM中南大学 H道路的算法，有测试数据和结果，希望对大家有用
Date : 2008-10-13 Size : 132.74kb User : shao
[Mathimatics-Numerical algorithms] Graph-Theory DL : 0: 图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
Date : 2008-10-13 Size : 9.79kb User : lllstar
[VOIP program] Delphi写的IP电话源码 DL : 0: Delphi写的IP电话源码-Delphi written source IP telephone
Date : 2025-07-03 Size : 38kb User : lihui
[Documents] Problem H DL : 0: 2004acm试题题解-2004acm questions that solution
Date : 2025-07-03 Size : 7kb User : 施委
[Windows Develop] HOJ DL : 0: 哈尔滨工业大学ACM 竞赛网上在线试题集锦，对你的编程能力的提高一定有很大帮助-Harbin Industrial University ACM Online Collection of questions, and for your ability to improve programming be of much help
Date : 2025-07-03 Size : 3.11mb User : 陈万通
[Data structs] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Date : 2025-07-03 Size : 10kb User : 罗鹏魁
[Fractal program] work2z DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Date : 2025-07-03 Size : 4kb User :
[Mathimatics-Numerical algorithms] Hroad DL : 0: ACM中南大学 H道路的算法，有测试数据和结果，希望对大家有用-Central South University ACM road H algorithm, has the test data and results, in the hope that useful U.S.
Date : 2025-07-03 Size : 132kb User : shao
[Mathimatics-Numerical algorithms] Graph-Theory DL : 1: 图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -err
Date : 2025-07-03 Size : 10kb User : lllstar
[Mathimatics-Numerical algorithms] hdu1297 DL : 0: 杭电acm1297 #include<stdio.h> #include<string.h> #define m 1002 int f[m][70]={{1,1},{1,1},{1,2},{1,4}} void add(int p[],int q[],int sum[]) { int i,len if(p[0]<q[0])len=q[0] else len=p[0] for(i=1 i<=len i++) { sum[i]+=q[i]+p[i] if(sum[i]>=10000){sum[i]-=10000 sum[i+1]++ } }-acm contest
Date : 2025-07-03 Size : 222kb User : 韩飞
[Other] PennState_III-V_TFET_VA_Model_1.0.1 DL : 0: //VerilogA for double-gate GaSb-InAs Heterojunction Tunnel FET model based on lookup tables, which employs the current and capacitance characteristics calibrated TCAD Sentaurus Simulations //Model details: V. Saripalli et al IEEE/ACM NanoArch 2011. //Original Model Developed by V. Saripalli //Implemented by H. Liu -//VerilogA for double-gate GaSb-InAs Heterojunction Tunnel FET model based on lookup tables, which employs the current and capacitance characteristics calibrated TCAD Sentaurus Simulations //Model details: V. Saripalli et al IEEE/ACM NanoArch 2011. //Original Model Developed by V. Saripalli //Implemented by H. Liu
Date : 2025-07-03 Size : 1.74mb User : achunn
[Other] TFET_VerilogA_models DL : 0: //VerilogA for double-gate GaSb-InAs Heterojunction Tunnel FET model based on lookup tables, which employs the current and capacitance characteristics calibrated TCAD Sentaurus Simulations //Model details: V. Saripalli et al IEEE/ACM NanoArch 2011. //Original Model Developed by V. Saripalli //Implemented by H. Liu -//VerilogA for double-gate GaSb-InAs Heterojunction Tunnel FET model based on lookup tables, which employs the current and capacitance characteristics calibrated TCAD Sentaurus Simulations //Model details: V. Saripalli et al IEEE/ACM NanoArch 2011. //Original Model Developed by V. Saripalli //Implemented by H. Liu
Date : 2025-07-03 Size : 2.06mb User : achunn
[Mathimatics-Numerical algorithms] mwdbqil DL : 0: ACM中南大学 H道路的算法,有测试数据和结果,希望对大家有用()
Date : 2025-07-03 Size : 132kb User : NIGJdchuw%24061066