[编译器/词法分析] redundantpaths

说明：c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
<jazz> 在 2025-07-30 上传 | 大小：2kb | 下载：0

[通讯编程] VBGPS

说明：VB对GPS的接口编程技术,给出了一个接口程序。-VB programming interface for the GPS technology, give an interface program.
<黄风云> 在 2025-07-30 上传 | 大小：3kb | 下载：0

[微处理器(ARM/PowerPC等)] S3C2410_ADC_Interface

说明：S3C2410 的 ADC和触摸屏接口说明-S3C2410 the ADC and Touch Panel Interface Descr iption
<bill> 在 2025-07-30 上传 | 大小：188kb | 下载：0

[JSP源码/Java] Golf_Ball_Allocation

说明：英国帝国理工学院电脑系多线程课程教学材料之十五 ---- 高尔夫球分配问题-At a golf club, players can hire golf balls for their game from the club and return them to the club after use. The better players, who tend not to lose any balls, only hire one or two. The less experienced playe
<Key> 在 2025-07-30 上传 | 大小：3kb | 下载：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-07-30 上传 | 大小：1kb | 下载：0

[Windows编程] can232_v1

说明：CAN 232 Windows Source
<于海> 在 2025-07-30 上传 | 大小：238kb | 下载：0

[系统编程] forth552

说明：WIN32FORTH V5.52 含全部源代码，是目前最小的开发环境。同时由于源代码全部公开，所以该开发工具也是学习windows编程原理的不错的材料。-win32forth
<w> 在 2025-07-30 上传 | 大小：97kb | 下载：0

[嵌入式/单片机编程] TIDSPminimumsystemschematic

说明：TI DSP最小系统原理图,5402芯片的-TI DSP minimum system schematic
<fishsky> 在 2025-07-30 上传 | 大小：150kb | 下载：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-07-30 上传 | 大小：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-07-30 上传 | 大小：2kb | 下载：0

[GIS编程] MapXdelphi

说明：使用delphi 软件对Mapx进行编程，在程序利对Mapx的各种操作控制非常详细。-Use delphi programming software MapX, MapX in procedures on a variety of operational control of very detailed.
<黄风云> 在 2025-07-30 上传 | 大小：503kb | 下载：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-07-30 上传 | 大小：1kb | 下载：0