资源列表
[软件工程] lyapunov2
说明:Sample software that implements this procedure while searching for chaotic solutions in general 2-D quadratic maps is available in (DOS) BASIC source and executable code. Sample software that calculates the Lyapunov exponent (-0.5 to 0.5) for the Hén<chaos> 在 2025-06-08 上传 | 大小:4kb | 下载:0
[软件工程] BiTree
说明:输入一个字符串,并建成一棵二叉树,满足左子树的字符都要小于根结点的字符,右字树的字符都要大于根结点的字符,每个结点值有字符和字符的出现次数,并用三种遍历方法打印,比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the<fanfausun> 在 2025-06-08 上传 | 大小:4kb | 下载:0
[软件工程] graph
说明:用邻接矩阵法建一无向连通图(顶点信息为字符),分别用dfs(深度优先搜索)和bfs(广度优先搜索)遍历,输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output<fanfausun> 在 2025-06-08 上传 | 大小:4kb | 下载:0