搜索资源列表
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trai
wodetanke
- 全面运用所学的JAVA理论对所设计的类进一步完善，并学会使用数组存储游戏地图数据，并能运用图形绘制方法和一定的算法将地图在游戏中绘制出来，并能控制游戏角色在地图可行走区域运动。-comprehensive study of the use of Java theory designed to further improve the class, and learning how to use the array game map data storage, and will be able to
Digitalmap
- Digital map algorithm. it could demonstrate the function and the effectiveness of the digital map
ant_code
- JAVA实现的基本蚁群算法源程序，可以选择地图，可以设置一些参数，有图形输出-JAVA realization of the basic ant colony algorithm source code, you can choose the map, you can set some parameters, there are graphics output
SCC
- Java实现的图的强连通分支算法，可以输入图的节点和边，并返回图中所有的强连通分支-Java to achieve strong connectivity of the graph branch algorithm, can enter graph nodes and edges, and return to map all of the strongly connected branch
BC
- Java实现的双连通分支算法，可以自行输入图的节点和边，并返回图中所有的双连通分支-Java connectivity to achieve the two-branch algorithm, can enter the graph nodes and edges, and return to map all of the dual-branch connectivity
dframe
- 利用模拟退火算法实现有向图最短路径的计算，基本与康立山的参数确定方法相同，只是结束条件改为温度下降到0.2截止。-Simulated annealing algorithm has to map the shortest path calculation, basic and Kang Lishan determine the parameters of the same way, but the conditions to end cut-off temperature dropped to
47278418ssdaquare
- java开放的小游戏，代码量500行，地图生成的简单算法，和播放动画的简单算法！有矩形碰撞-500 lines of code size, map generation simple algorithm, and the simple algorithm animation! A rectangular collision
youxingo
- Java代码量500行，地图生成的简单算法，和播放动画的简单算法！有矩形碰撞。-500 lines of Java code size, map generation simple algorithm, and the simple algorithm animation! A rectangular collision.
expo
- 一款世博园区地图查询软件，为java编写，含有完整数据库，使用了迪杰特斯拉算法选路。-A World Expo site map query software, written for java contains the full database, use the Dykstra algorithm.
yangliu
- 用KNN算法实现的文本分类系统，很详细，作者很强大，尤其是对于MAP的使用，炉火纯青，值得学习，受益匪浅！-KNN algorithm with the text classification system, very detailed, the author is very strong, especially for the use of the MAP, high degree of professional proficiency, it is worth learning, benef
src
- 栅格图的读取，变色龙算法聚类，聚类后图像的输出-The raster map reading, Chameleon algorithm for clustering, clustering image output
gpsOptimize
- gps轨迹优化，gps采样的点显示轨迹的时候，由于gps漂移和定位精度的原因，地图上显示的轨迹不太理想，通过卡尔曼算法，是轨迹达到平滑的效果-gps trajectory optimization, gps sampling point display trajectory, because of drift and gps positioning accuracy reasons, the track displayed on the map is not ideal, through Kal
Dijkstra
- 任意给定图，10个结点以上，实现图，并用迪杰斯特拉算法求最短路径 注：在D盘存放节点之间的权值-Any given map, more than 10 nodes to achieve chart, and use Dijkstra shortest path algorithm
GPSCorrect
- 地图经纬度纠偏算法，可以实现原始GPS坐标转谷歌坐标，也可以实现谷歌坐标转百度坐标，当然也就能实现GPS坐标转百度坐标啦-Map latitude and longitude correction algorithm can achieve the original GPS coordinates turn Google coordinates, can also be achieved Google coordinates turn Baidu coordinates, of course,
projet_IG_clliping
- this source code implements the clliping algorithm in java, the user can draw randomly a forme after that a rectangle that he want to see, so the program will cut the original picture in the same way as the rectangle that the user choosed, this kind
Image-conversion
- 此算法是图像之间的转换，二值图，RGB等的相互转换源代码-This algorithm is the conversion between the images, the two value of the map, RGB, and so on the conversion of the source code
FindWay5.0
- 基于A*算法的路径规划，简易地图，起点终点障碍物可设置。(The path planning based on the A* algorithm, the simple map, the starting point and the end point barrier can be set.)