This repository was archived by the owner on Jun 18, 2026. It is now read-only.
test: add comprehensive tests for ShortestPathFinder - #91
Merged
Merged
Conversation
Add 20 test cases covering: - BFS shortest path by hops (same vertex, direct neighbor, chain, disconnected) - Dijkstra shortest path by weight (lighter path preference, zero-weight normalization, negative weight rejection) - Reachability (isolated vertex, connected component) - Connectivity checks (same vertex, neighbors, transitive, disconnected) - PathResult.toString formatting - Directed graph edge direction respect - Diamond graph optimal path selection - Input validation (null graph, null vertex, missing vertex)
|
You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Adds 20 unit tests for \ShortestPathFinder, covering BFS shortest path, Dijkstra weighted shortest path, reachability, connectivity, directed graph support, and input validation.
Test coverage includes:
Follows existing test conventions (JUNG UndirectedSparseGraph/DirectedSparseGraph, JUnit 4).