搜索资源列表
树形菜单.rar
- 树形菜单较滑动菜单稍微复杂一点。其主要难点在于从简洁的数据描述来产生便于操纵的html结构。 本例用来展示树形菜单的编写。使用无线表格，算法上采用了递归，理论上可构造无穷分制枝的树。 本代码可自由扩散。,tree menu than sliding menu a little more complicated. The main difficulty lies in concise descr iption of the data to generate the html easy manipu
CShortestLenPCB
- 采用分枝限界法进行求解最短路径长度的问题，是算法设计中的经典题目-Branch and Bound method used to solve the problem of the shortest path length, is the classic algorithm design topics
depth_first_search_algorithm
- 网络算法中关于深探分枝（深度优先搜索）的算法实现。-This algorithm discribes depth-first search.
bb
- 货郎担分枝限界图形演示 很不错的源码哦-Branch and Bound graphical presentation traveling salesman
Project_BFS
- 任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中 工程名：Project_BFS 要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点 -Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFS
integer-linear-programming
- 最优化的里整数规划里0—1规划算法和分枝定界法，matlab编写，代码规范，方便初学者学习！-the program is with the binary integer linear programming and integer linear programming use branch and bound method!
CShortestLenPCB
- 采用分枝限界法进行求解最短路径长度的问题，是算法设计中的经典题目-Branch and Bound method used to solve the problem of the shortest path length, is the classic algorithm design topics
用分枝定界法求解整数线性规划问题
- matlab代码，用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)