搜索资源列表
tc201
- turbo c 2.0 一个相当经典的编程工具，个人强烈推荐-turbo c 2.0 a very classical programming tools, personal strongly recommended
1046843849257
- 由于开发时间创促，未对分辨率进行分类考虑，所以强烈推荐1024X768下面运行。 (对于winXP操作系统，可以正常运行，但是会发现速度很慢，具体问题有待解决。对于 其他操作系统有可能出现不可预料的问题) 控制键 1P:方向键 w s a d 开火: j 2P:方向键 上 下 左 右 开火: 小键盘0 本游戏内置15种彩蛋，具有一定趣味性，但需要慢慢体会。 由于为了节约空间，所以去掉了背景图，并把一些图片地效果改低，唯一优点就是小-as
源代码-高源
- 包括10个源码：1 令系统托盘(提示区/Sys tray)中的图标显示气泡提示框(Tool Tip)的代码 2 软盘格式化程序 3 一个虚拟驱动盘映射器 4 这个软件可以得到大多数的“高级”系统信息，比如系统缓存的密码、PROXY设置、网卡MAC等 5 用过Flashget和网络蚂蚁的朋友应该知道在IE中右击右击菜单有使用(xxxxx)下载.本代码就实现此功能。可以获取在网页中选择的文本,链接 地址，图片. 6 引起轰动的源码，能在视窗
ASP.NET编写的网络像册QuickAlbum
- ASP.NET编写的网络像册,可以作为模板开发个人网站或其他，强烈推荐。-ASP.NET prepared by the network album artwork, as a template can develop individual sites or other, strongly recommended.
CDirTreeCtrl_src
- 这段源码是用win32api 自己封装的CDirTreeview,出自名人之手，强烈推荐-this source is used win32api CDirTreeview own package, from the hands of celebrities and strongly recommended
经典聊天程序
- 经典聊天程序，使用socket的很好的一个示范，强烈推荐-classic chat, the use of the socket of a good model, strongly recommended
RedBlackTree_source
- 经典的红黑树算法，强烈推荐-classic Brooklyn Tree Algorithm, strongly recommended
zb2
- 有向图的强连通的分量的实现-directed graph strongly connected component of the realization
sgraph
- 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
GraphCC
- 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
StrongComent
- 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
Cpp1
- 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
TheBottomofaGraph.tar
- ACM题解：The Bottom of a Graph 求图的强连通分量的好例子-ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components
SCC_Library
- Strongly Connected Component Library to obtaion strongly connected components of a graph, for PC platforms writeen in Visual C-Strongly Connected Component Library to obtaion strongly connected components of a graph, for
Suanfa_3
- java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under
ApplicationsOfDepth-FirstTraversal
- 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。 通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DF
strongly-connected-
- Find out strongly connected component of a directed graph in c
strongly-connected-component-
- 图的强连通部分,给定一个有向图，求改图的强连通部分-the strongly connected component
strongly-connected
- 有向图的强连通分量算法的实现，编译、运行及调试环境: Microsoft Visual C-Directed graph strongly connected components algorithm implementation, compiling, running and debugging environment: Microsoft Visual C++
Strongly Connected Components
- 计算图的强连通分量，C代码实现，windows平台测试通过。(Strongly connected components of a graph)