swgl商务管理系统

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

dbcmp是一个数据库内容比较工具。用于比较数据库的两个表数据之间的差异,并通过WEB的形式高亮显示。dbcmp运行于Linux/Unix平台,目前只支持Oracle.运行前用户要配置dbcmp.cfg、dbcmp.tbl、dbcmp.xcols文件. 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

迷宫问题的一个简单程序，此程序简单易懂，很好理解，适合初学者看-Problem a simple maze procedure, this procedure simple and easy to understand, well understood, suitable for beginners to see

一个递归算法,并把递归出的文件隐藏,使用VB开发,希望大家支持-A recursive algorithm, and recursive documents are hidden, use the VB development, I hope you will support

求和最大的子序列，采用动态规划算法，经典算法-sequences using dynamic programming algorithm, the algorithm classic

图论中最小生成树Kruskal算法 及画图程序 M-函数-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function

1.oracle OCI 数据类封装 支持linux windows 2.通过封装不同类驱动

MATHEMATICA 程序 最短路径算法-MATHEMATICA procedure shortest path algorithm

界面美观,功能齐全,连接数据库,适合初学者-Interface appearance, complete functions, connected databases, suitable for beginners

纯C写的48位软件模拟浮点运算,可移植 测试版，V0.0000.01 需进一步测试及优化-Written in pure C software simulation of 48 floating-point operations can be transplanted beta, V0.0000.01 need further testing and optimization