This Java application is an interactive command-line tool that demonstrates and compares two classic pathfinding algorithms: Dijkstra's algorithm for weighted graphs and Floodfill (Breadth-First Search) for unweighted graphs. The program finds the optimal path between two user-defined points on a 2D grid composed of various terrain types.

DSĀ qustions solutions by java

基于java swing的简单扫雷游戏,实现了基本逻辑.主要用到了floodfill算法和随机洗牌算法

Flood Fill Algoritm