资源列表
moto
- 电机仿真,含阻尼微分方程的M函数程序和仿真图，需要这个方面的学者可以参考-moto simulink and about M .
vcCommonSourse
- vc日常代码。经常用到的vc代码，选择看看有好处-vc day-to-day code. Frequently used code vc
auto
- auto uopdate ip, client auto update ip
test
- 计算器，电子时钟 .自己做的，所以非常珍贵，网上虽然有很多方法，但这个方法是我自己想出来的哦-computer caculate computer caculate computer caculate computer caculate computer caculate
stackqueue
- this implement stack
ADO
- 用ADO进行数据库中数据进行动态显示和管理.并能通过ODBC与数据库相联-ADO database with data for dynamic display and management. And can be associated with a database ODBC
click
- 很不错的-一款软件-能够注册刷站，谢谢-想要的快点下载-Very good- a software- be able to register brush station, thank you- want to hurry up and download
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
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
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.
can232_v1
- CAN 232 Windows Source
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