GitHub / barannmeisterr / Optimal-Pathfinding-in-a-Coastal-Island-Network-with-State-Dependent-Ports-
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/barannmeisterr%2FOptimal-Pathfinding-in-a-Coastal-Island-Network-with-State-Dependent-Ports-
PURL: pkg:github/barannmeisterr/Optimal-Pathfinding-in-a-Coastal-Island-Network-with-State-Dependent-Ports-
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: Java
Size: 13.7 KB
Dependencies parsed at: Pending
Created at: over 1 year ago
Updated at: about 1 year ago
Pushed at: about 1 year ago
Last synced at: 4 months ago
Topics: bfs, dfs, java, oop, optimization-algorithms, pathfinding, queue, singly-linked-list, stack, undirected-graph