资源列表
bellman_ford
- 图论中最短路径的一些算法，包括bellman_ford等-Shortest path algorithm in graph theory, including bellman_ford
Knapsack-problem(DP)
- 本文档详细分析了动态规划的经典模型-背包问题，能够有效强化对该类型算法的理解。-This document is a detailed analysis of the classic model of the dynamic programming- knapsack problem, can effectively enhance the understanding of this type of algorithm.
VHDL_model_16_bit_DAC_sigma_delta
- VHDL code for a sigma delta DAC 8 bit
Maze
- 迷宫求解：用二维矩阵表示迷宫，自动生成或者直接输入迷宫的格局，确定迷宫是否能走通，如果能走通，输出行走路线。 c实现-Solve the maze: maze, two-dimensional matrix that automatically generated, or directly enter the maze pattern, to determine the labyrinth whether to go through, if we can go through the outpu
Queen
- 八皇后问题：设8皇后问题的解为 (x1, x2, x3, …,x8), 约束条件为：在8x8的棋盘上， 其中任意两个xi和xj不能位于棋盘的同行、同列及同对角线。要求用一位数组进行存储，输出所有可能的排列。C实现-Eight queens problem: Let the eight queens problem, the solution (x1, x2, x3, ..., x8), constraint conditions: on a 8x8 board, in which any t
Josephus
- 线性表实现约瑟夫（Josephus）环问题 VC实现-Linear table to achieve Joseph (Josephus), Central problems VC in
EightDigital
- 八数码算法实现，带界面，可输入初始状态，逐步演示-Eight digital algorithm, with the interface, enter the initial state, step by step demonstration
com121
- this file is check data
HL20120101006
- 方形算法计算股票的发展趋势，达到预测股票走势的算法-Square algorithm to calculate the development trend of the stock, to predict the stock trend algorithm
0-1
- 0-1背包问题算法书籍代码，同大家分享！-0-1 Knapsack Problem Books in code share with you!
wenjiansuo
- e语言文件夹加密源码 再也不用担心隐私泄漏问题-e language folder encryption source code no longer have to worry about privacy leaks !
BinaryTree
- 二叉树操作的一些算法函数，遍历方法，迭代器，线索树，内附文档-Algorithmic functions of the binary tree operations, traversal methods, iterators, clues tree, enclosing document