安卓图形化最短路径求解 (无向图+迷宫)，二维码扫描

This small project is for performing operations on graph, traversal (both BFS and DFS), and searching a path between two nodes.

A super simple graph library supporting basic operations that can serve as a base for a more sophisticated implementation or for learning purposes.

This project aims to solve the problem of finding the lexicographically smallest path that takes the minimum amount of time to travel between two islands in a coastal city.

This is a school project from Data Structures and Algorithms course where graphs, Prim's Algorithm and Dijkstra's Algorithm are used effectively. It is an application of finding shortest path and minimum spanning tree on graphs. The project is thematized with legendary love story of Leyla and Mecnun. The aim of the project is brought together Le…

This project converts a maze into a graph representation and performs various graph-related operations on it.The maze is represented as a 2D array of characters where: "S" indicates the start point, "F" indicates the final (end) point,"E" indicates an empty point, and "-" indicates a wall.

An undirected graph implementation in Java.

Demonstrates the 6 degrees of Kevin Bacon

This project finds the smallest path with minimum spanning tree value of connection to loads and source which is Minimum Spanning Tree of the undirected graph and finds the shortest paths from a single source to all load points and the graph is directed graph.