Search - mouse - CodeBus

Search - mouse - List

[Data structs] wiree DL : 0: 这是一个关于小白鼠迷宫的问题，程序已经通过运行验收。-This is a mouse maze on the issues, procedures have been running through acceptance.
Date : 2025-12-21 Size : 486kb User : 赵寰
[Data structs] Maze DL : 0: 这事传统的老鼠迷宫的源代码，利用了堆栈的原理，可以记录走出迷宫的路径，有助于更好的理解堆栈知识。-This traditional mouse maze source code, using a stack of principle, can be recorded out of the maze path, contribute to a better understanding of the stack of knowledge.
Date : 2025-12-21 Size : 895kb User : Iris
[Data structs] GraphW DL : 0: 最小生成树支持鼠标点击生成结点并且动态生成最小树-Minimum Spanning Tree support mouse clicks generated dynamically generated nodes and minimum spanning tree
Date : 2025-12-21 Size : 104kb User : 黄易
[Data structs] maze DL : 0: 老鼠走迷宫的程序，C语言完成。用到了队列数据结构-Mouse Maze procedure, C language completed. Use a queue data structure
Date : 2025-12-21 Size : 2kb User : lanjun
[Data structs] firstproblem DL : 0: 最近点对问题的图形界面实现，用户可以通过鼠标输入点集，也可以通过随机生成点集，程序会将最近的两个点用红色标示出来-Nearest point on the question of the realization of a graphical interface, users can mouse input point set, can also be randomly generated point set, the program will be the two most recent points, marked in red
Date : 2025-12-21 Size : 5kb User : hetengfei
[Data structs] MOUSEFINDWAY DL : 2: 传统的老鼠走迷宫程序通过堆栈来实现的 C++ 程序-little mouse find the right way in a maze
Date : 2025-12-21 Size : 216kb User : 王飞
[Data structs] TheUnderlyingProgramming DL : 0: c写的小程序，包括鼠标检测，时间陷阱，检测出错等。-c write small procedures, including the mouse detection, time traps, such as error detection
Date : 2025-12-21 Size : 11kb User : liyang
[Data structs] CatCatchRat DL : 0: 数据结构与主要算法: (1)老鼠个数的设定 (2)关数的设定 (3)老鼠的灵活度-Data structure and algorithms: (1) the number of mice (2) the number set off (3) mouse flexibility
Date : 2025-12-21 Size : 647kb User : 王二小
[Data structs] Underlying_development DL : 0: 包含几个底层编程小例子，如时间陷阱和检测鼠标等。-Contains several low-level programming of small examples, such as time and testing the mouse traps, etc..
Date : 2025-12-21 Size : 11kb User : mei
[Data structs] PointPair DL : 0: 根据分治算法实现求平面上最近点对的复杂度为(nlgn)的算法有图形界面，能通过鼠标输入点-Under sub-rule algorithm seeking the nearest point on the plane of the complexity of (nlgn) algorithm for graphical interface, through mouse input points
Date : 2025-12-21 Size : 740kb User : liupz
[Data structs] BestPath DL : 0: 主要实现最短路径的可视化展示。可以在程序中利用鼠标绘制路网，自定义起点和终点后就能自动的绘制出最短路线。-To achieve the shortest path to the main visualization display. Can be used in the program draw the road network in the mouse, custom start and finishing point will be able to automatically draw the shortest route.
Date : 2025-12-21 Size : 3.91mb User : dada
[Data structs] migong DL : 0: 利用栈结构实现迷宫求解问题。迷宫求解问题如下：心理学家把一只老鼠从一个无顶盖的大盒子的入口赶进迷宫，迷宫中设置很多隔壁，对前进方向形成了多处障碍，心理学家在迷宫的唯一出口放置了一块奶酪，吸引老鼠在迷宫中寻找通路以到达出口。-Achieved using a stack maze to solve the problem structure. Maze solving the problem as follows: psychologist to a mouse from a big box without top cover the entrance drive into the maze, maze set a lot next door, on the way forward the formation of a multiple barrier, the only psychologist in the maze exit Place a piece of cheese to attract rats in the maze to find pathways to reach the exit.
Date : 2025-12-21 Size : 571kb User : 林佳
[Data structs] classic_C_algrithm DL : 0: 里面包括了很多经典的算法，包括河内塔费式数列巴斯卡三角形三色棋老鼠走迷官（一）等等 -Which includes many classic algorithms, including the Tower of Hanoi Fibonacci Liebasika triangular tri-color chess mouse labyrinth walk (1), etc.
Date : 2025-12-21 Size : 431kb User : my
[Data structs] Mouse DL : 0: 电子老鼠闯迷宫如下图12×12方格图，找出一条自入口（2，9）到出口（11，8）的最短路径。 -Chuang Electronic Mouse maze as illustrated 12 × 12 grid map, to find a self-entry (2,9) to export (11,8) shortest path.
Date : 2025-12-21 Size : 1kb User : zhangkai
[Data structs] compmouse DL : 0: 老鼠走迷宫程序实际示例可以寻找所有路径以及找出所有路径当中的最短路径。-Mouse Maze procedure can find all the practical example of the path and find the shortest path among all paths.
Date : 2025-12-21 Size : 2kb User : 石玉
[Data structs] 2 DL : 0: 有一只电子老鼠被困在如下图所示的迷宫中。这是一个12*12单元的正方形迷宫，蓝色部分表示建筑物，白色部分是路。电子老鼠可以在路上向上、下、左、右行走，每一步走一个格子。现给定一个起点S和一个终点T，求出电子老鼠最少要几步从起点走到终点-Have an electronic mouse trapped in the maze as shown below. This is a square of 12* 12 unit maze, the blue part of that building, the white part is the Way. E-mouse on the go up, down, left and right to walk every step of the walk a grid. S is given a starting point and an end point T, obtained at least a few steps from the electronic mouse from coming to an end
Date : 2025-12-21 Size : 1kb User : clare
[Data structs] Mouse-maze-drill DL : 0: 这是一个很简单的小白鼠进迷宫算法，可能还存在不足的地方-This is a very simple mouse into the maze algorithm, there may be deficiencies
Date : 2025-12-21 Size : 2kb User : 李磊
[Data structs] The-algorithm-of-computer-mouse DL : 0: 这个程序是基于615型号的电脑鼠搜索迷宫和冲刺及体现一些上层算法的程序。-This procedure is based on the615models of the computer mouse maze and sprint and embody some search the algorithm procedure.
Date : 2025-12-21 Size : 24kb User : 陈晨
[Data structs] The-computer-mouse-intelligence-turn DL : 0: 2012年电脑鼠实现了16*16的稳定搜索与智能拐弯返回与冲刺。-2012 the computer mouse realized 16* 16 search and intelligent stable returns on sprint.
Date : 2025-12-21 Size : 302kb User : 陈旭
[Data structs] mouse DL : 0: 一個常見的老鼠走迷宮練習代碼，使用stack來解答，內附迷宮格式(maze.in)-A common practice Mouse Maze code that uses the stack to answer, containing a maze format (maze.in)
Date : 2025-12-21 Size : 2kb User : Wind

« 12 3 4 »