求无向图连通分支_dfs实现,很好用，希望和大家分享

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

VB6.0下DataGrid控件的使用示例！-VB6.0 under the DataGrid control the use of examples!

login sript .PHP usefull to connect DB

压缩包内解决用计算机实现图论中的最短路问题-Compression package to resolve the computer graph theory realize the shortest path problem

程序，很好的程序-procedures are good procedures

数据结构，栈的应用，表达式求值的源码及实验报告！-Data structure, stacks of applications, the source expression is evaluated and experimental report!

由于时间仓促，所以功能比较简单。有兴趣者可以继续扩展这个系统！-Because time is so short, relatively simple function. Interested persons can continue to expand this system!

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法 -In graph theory a Kruskal algorithm for minimum spanning tree algorithm in graph theory a classical algorithm

适合Java初级学者的滴滴打车系统选择出发地址和目的地，会寻找最短路径，进行最低消费。根据走的路径的距离来判断收费的情况，可以随时更新出租车司机的基本信息，以及车辆的维修情况