Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.
This report summarizes scanner evidence for graphhopper/graphhopper, a Java project with 6,750 GitHub stars. SynthScan examined 222,503 lines of code across 1221 source files, recording 60 pattern matches distributed across 9 syntactic categories. The legacy adjusted pattern signal is 0.6 (Low pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.
Can maintainers explain intent, assumptions, and trade-offs? 47 finding(s).
Are imports declared and package/API names verified? 11 finding(s).
Are wrappers, guards, and repeated structures necessary? 5 finding(s).
Which changes need focused human review? 60 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 60 distinct pattern matches across 9 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 2373 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 2556 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 4100 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 4337 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 4558 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | web-bundle/src/main/java/vector_tile/VectorTile.java | 5375 | com.google.protobuf.AbstractMessageLite.Builder.addAll( | CODE |
| CRITICAL | …/src/main/java/com/graphhopper/gtfs/TripFromLabel.java | 184 | return new com.graphhopper.gtfs.fare.Trip.Segment(ptLeg.feed_id, ptLeg.route_id, | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | config-example.yml | 1 | graphhopper: | COMMENT |
| LOW | config-example.yml | 21 | # allow_turn_penalty_in_request: true (enable custom turn_penalty for requests at runtime) | COMMENT |
| LOW | config-example.yml | 41 | - name: foot | COMMENT |
| LOW | config-example.yml | 61 | # | COMMENT |
| LOW | config-example.yml | 81 | COMMENT | |
| LOW | config-example.yml | 101 | COMMENT | |
| LOW | config-example.yml | 121 | # prepare.ch.threads: 1 | COMMENT |
| LOW | config-example.yml | 141 | # graph.elevation.dataaccess: RAM | COMMENT |
| LOW | config-example.yml | 161 | # elevation and will remove the extra points that long edge sampling added | COMMENT |
| LOW | config-example.yml | 181 | # graph.urban_density.residential_radius: 400 | COMMENT |
| LOW | config-example.yml | 201 | COMMENT | |
| LOW | config-example.yml | 221 | # motorized vehicles. This leads to a smaller and less dense graph, because there are fewer ways (obviously), | COMMENT |
| LOW | config-example.yml | 241 | # graph.dataaccess.type.edges: FOREIGN_MMAP | COMMENT |
| LOW | benchmark/download_map.sh | 1 | #!/bin/bash | COMMENT |
| LOW | benchmark/benchmark.sh | 1 | #!/bin/bash | COMMENT |
| LOW | benchmark/post_benchmark.sh | 1 | #!/bin/bash | COMMENT |
| LOW | tools/src/main/java/com/graphhopper/ui/MiniGraphUI.java | 421 | COMMENT | |
| LOW | …est/java/com/graphhopper/util/InstructionListTest.java | 441 | COMMENT | |
| LOW | …/src/test/java/com/graphhopper/util/GHUtilityTest.java | 61 | // assertTrue(map2.containsValue(0)); | COMMENT |
| LOW | …m/graphhopper/storage/index/LocationIndexTreeTest.java | 41 | COMMENT | |
| LOW | …m/graphhopper/storage/index/LocationIndexTreeTest.java | 521 | COMMENT | |
| LOW | …/com/graphhopper/routing/CHQueryWithTurnCostsTest.java | 581 | // at node 2 we cannot go from 4 to 1 directly, but we need to take the loop at 2 first. when the backward | COMMENT |
| LOW | …java/com/graphhopper/routing/AStarBidirectionTest.java | 41 | // already arrived and the stopping criterion is fulfilled. Node 2 still remains in the queue at this point. | COMMENT |
| LOW | …hhopper/routing/subnetwork/NodeBasedTarjanSCCTest.java | 141 | public void testTarjan_issue761() { | COMMENT |
| LOW | …/routing/util/parsers/BikeAccessAndRoadAccessTest.java | 81 | Arguments.of("residential", "motor_vehicle=no", true, B | COMMENT |
| LOW | …/test/java/com/graphhopper/routing/lm/LMIssueTest.java | 101 | // Eventually the best path was not updated correctly because the spt entry of the fwd search already had a way | COMMENT |
| LOW | …st/java/com/graphhopper/routing/ch/CHTurnCostTest.java | 161 | // 0 3 - 4 8 | COMMENT |
| LOW | …st/java/com/graphhopper/routing/ch/CHTurnCostTest.java | 441 | public void testFindPath_randomContractionOrder_complicatedGraphAndPath() { | COMMENT |
| LOW | …pper/routing/ch/PrepareContractionHierarchiesTest.java | 321 | BaseGraph g = new BaseGraph.Builder(encodingManager).create(); | COMMENT |
| LOW | …main/resources/com/graphhopper/custom_models/bike.json | 1 | // to use this custom model you need to set the following option in the config.yml | COMMENT |
| LOW | …re/src/main/java/com/graphhopper/search/KVStorage.java | 61 | // map = new HashMap(); map.put("some", "value"); map.put("some2", "value2"); is added via the method add, then we s | COMMENT |
| LOW | …/main/java/com/graphhopper/geohash/SpatialKeyAlgo.java | 41 | * See the drawing below. This is called a Z-order curve (because of the path you get when you follow | COMMENT |
| LOW | …m/graphhopper/isochrone/algorithm/JTSTriangulator.java | 81 | // Sites may contain repeated coordinates. Especially for edge-based traversal, that's expected -- we visit | COMMENT |
| LOW | …ain/java/com/graphhopper/routing/AlternativeRoute.java | 281 | correspondingToEntry = correspondingToEntry.parent; | COMMENT |
| LOW | …in/java/com/graphhopper/routing/lm/LMApproximator.java | 141 | return (maxWeightInt - 1) * factor; | COMMENT |
| LOW | …in/java/com/graphhopper/routing/lm/LMApproximator.java | 161 | // | COMMENT |
| LOW | …re/src/main/java/com/graphhopper/routing/ev/State.java | 41 | COMMENT | |
| LOW | …/main/java/com/graphhopper/http/GraphHopperBundle.java | 241 | for (Object k : System.getProperties().keySet()) { | COMMENT |
| LOW | …s/src/main/java/com/graphhopper/gtfs/PtRouterImpl.java | 261 | if (visitedNodes >= maxVisitedNodesForRequest) { | COMMENT |
| LOW | …rc/main/java/com/graphhopper/matching/MapMatching.java | 681 | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | …ent-hc/src/test/java/com/graphhopper/api/Examples.java | 24 | String apiKey = "<YOUR_API_KEY>"; | CODE |
| HIGH | …ent-hc/src/test/java/com/graphhopper/api/Examples.java | 24 | String apiKey = "<YOUR_API_KEY>"; | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | config-example.yml | 240 | # If FOREIGN_MMAP is not suited for everything you can use it for selected files e.g. while import to reduce heap usag | COMMENT |
| MEDIUM | config-example.yml | 246 | # If also for routing the environment is heap constrained and you can sacrify speed, then you can also use FOREIGN_MMA | COMMENT |
| MEDIUM | reader-gtfs/config-example-pt.yml | 3 | # for multiple files you can use: gtfs.file: file1.zip,file2.zip,file3.zip | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | map-matching/tools/mapmatch.py | 278 | L.control.layers(null, overlays).addTo(map); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | map-matching/tools/mapmatch.py | 59 | print(f"Error: --chunk must be between 1 and {len(chunks)}", file=sys.stderr) | CODE |
| MEDIUM | map-matching/tools/mapmatch.py | 173 | print(f"Error: debug template not found at {template_path}", file=sys.stderr) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …in/java/com/graphhopper/gtfs/PtRouterFreeWalkImpl.java | 116 | private class RequestHandler { | CODE |
| LOW | …s/src/main/java/com/graphhopper/gtfs/PtRouterImpl.java | 115 | private class RequestHandler { | CODE |
| LOW | …n/java/com/graphhopper/gtfs/PtRouterTripBasedImpl.java | 92 | private class RequestHandler { | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …hhopper/routing/util/NameSimilarityEdgeFilterTest.java | 52 | edge = createTestEdgeIterator("Lorem Ipsum"); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | map-matching/tools/mapmatch.py | 128 | CODE |