资源列表
[其他小程序] mplementation
说明:本文介绍的是关于国内汽车定位的方面的,是在C++程序编写的下进行的-This article is about the introduction of the domestic auto-targeted areas, are in C++ program prepared under<杨城> 在 2025-11-14 上传 | 大小:484kb | 下载:0
[其他小程序] Calculator
说明:本程序为仿照Windows计算器制作,其中基本功能已经达到,不过程序在十六进制与其它进制转换时有点缺陷,有后本人会加以完善。-This procedure is modeled on Windows calculator production, has reached one of the basic functions, but the procedures in the hexadecimal notation conversion with other little shortcoming<姜华> 在 2025-11-14 上传 | 大小:112kb | 下载:0
[其他小程序] migongzuiduanlujing
说明:会给你一个意外的惊醒.很经典的!! 希望你也给我推荐一些相似的东西-Will give you an unexpected awakened. Very classic!! Hope you will give me recommend some similar things<jun> 在 2025-11-14 上传 | 大小:1kb | 下载:0
[其他小程序] zhaodm.cn_a01142204e724ad192de18bd41f29331
说明: 投票功能的完整实现... 投票功能的完整实现- ok 投票功能的完整实现...<qintao> 在 2025-11-14 上传 | 大小:261kb | 下载:0
[其他小程序] cvPreProcessor-090Beta
说明:OpenCV workspace and code generator. With this utility you can try many images algorithm sequence and generate the C/C++ code for opencv to use it in your projects -OpenCV workspace and code generator. With this utility you can try many images algori<Flavio> 在 2025-11-14 上传 | 大小:296kb | 下载:0
[其他小程序] cycles
说明:Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency<jazz> 在 2025-11-14 上传 | 大小:1kb | 下载:0
[其他小程序] ShortestPaths
说明:Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.<jazz> 在 2025-11-14 上传 | 大小:2kb | 下载:0
[其他小程序] ShortestPathsEdge
说明:In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh<jazz> 在 2025-11-14 上传 | 大小:2kb | 下载:0
[其他小程序] EdgeDisjointCycles
说明:Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed<jazz> 在 2025-11-14 上传 | 大小:1kb | 下载:0