🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 20 (from laksa169)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa020.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://www.adamk.org/shortest-path-bellman-ford-algorithm/\')), getAhrefsUnparsedNoserviceFromURL(\'https://www.adamk.org/shortest-path-bellman-ford-algorithm/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/","crawl_time":1776280155,"first_indexed_time":1555046164,"http_code":200,"src_unparsed":"org,adamk!www,\/shortest-path-bellman-ford-algorithm\/ s443","src_root_hash":"12703082565510054020","history_drop_reason":null,"meta_title":"Shortest Path – Bellman Ford algorithm | adamk.org","meta_descriptions":[],"attrs_boilerpipe_text":"Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph:\nThis is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this:\nThe above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity:\nTo keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made.\nThis entry was posted in\nprogramming\nand tagged\nalgorithms\n,\ncoding\n. Bookmark the\npermalink\n.","attrs_markdown":"[Skip to content](https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/#content)\n\n[adamk.org](https:\/\/www.adamk.org\/)\n\nAdam's random thoughts…\n\n![adamk.org](https:\/\/www.adamk.org\/wp-content\/uploads\/2011\/04\/earth-wp.jpg)\n\n- [Home](http:\/\/www.adamk.org\/)\n- [xdiffr](https:\/\/www.adamk.org\/xdiffr\/)\n- [SudokuSolverX](https:\/\/www.adamk.org\/sudokusolverx\/)\n- [Algorithms](https:\/\/www.adamk.org\/algorithms\/)\n- [About](https:\/\/www.adamk.org\/about\/)\n\n[← Fibonacci spiral](https:\/\/www.adamk.org\/fibonacci-spiral\/)\n\n[Shortest Path – Dijkstra’s algorithm →](https:\/\/www.adamk.org\/shortest-path-dijkstras-algorithm\/)\n\n# Shortest Path – Bellman Ford algorithm\nPosted on [11th April 2019](https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/ \"11:58 pm\") by [adam](https:\/\/www.adamk.org\/author\/adam\/ \"View all posts by adam\")\n\nHere are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph:\n\n[![](https:\/\/www.adamk.org\/wp-content\/uploads\/2019\/04\/whiteboard-bellmanford-1024x768.jpg)](https:\/\/www.adamk.org\/wp-content\/uploads\/2019\/04\/whiteboard-bellmanford.jpg)\n\nThis is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this:\n\nThe above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity:\n\nTo keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made.\n\nThis entry was posted in [programming](https:\/\/www.adamk.org\/category\/programming\/) and tagged [algorithms](https:\/\/www.adamk.org\/tag\/algorithms\/), [coding](https:\/\/www.adamk.org\/tag\/coding\/). Bookmark the [permalink](https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/ \"Permalink to Shortest Path – Bellman Ford algorithm\").\n\n[← Fibonacci spiral](https:\/\/www.adamk.org\/fibonacci-spiral\/)\n\n[Shortest Path – Dijkstra’s algorithm →](https:\/\/www.adamk.org\/shortest-path-dijkstras-algorithm\/)\n### Leave a Reply [Cancel reply](https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/#respond)\n\n- ### Recent Posts\n  - [Binary Indexed Tree (Fenwick Tree)](https:\/\/www.adamk.org\/binary-indexed-tree-fenwick-tree\/)\n  - [Boyer-Moore Majority Vote Algorithm](https:\/\/www.adamk.org\/boyer-moore-majority-vote-algorithm\/)\n  - [Smart pointers](https:\/\/www.adamk.org\/smart-pointers\/)\n  - [Binary Search](https:\/\/www.adamk.org\/binary-search\/)\n  - [Leetcode 45: Jump Game II](https:\/\/www.adamk.org\/leetcode-45-jump-game-ii\/)\n- ### Recent Comments\n  - [Leetcode 46: Permutations \\| adamk.org](https:\/\/www.adamk.org\/leetcode-46-permutations\/) on [Leetcode 31: Next permutation](https:\/\/www.adamk.org\/leetcode-31-next-permutation\/#comment-9935)\n  - [xdiffr initial release \\| adamk.org](https:\/\/www.adamk.org\/xdiffr-initial-release\/) on [XDiff](https:\/\/www.adamk.org\/xdiff\/#comment-9672)\n  - [the check is cut](http:\/\/www.facebook.com\/hernandezru) on [Zombie ants controlled by parasite fungus](https:\/\/www.adamk.org\/zombie-ants-controlled-by-parasite-fungus\/#comment-13)\n  - [Wedding ideas](http:\/\/www.weddingplannerphotography.com\/) on [Zombie ants controlled by parasite fungus](https:\/\/www.adamk.org\/zombie-ants-controlled-by-parasite-fungus\/#comment-12)\n  - [Douglass](http:\/\/surfmag.theblogsyndicate.com\/) on [Freezing hard drive as last resort data recovery](https:\/\/www.adamk.org\/freezing-hard-drive-as-last-resort-data-recovery\/#comment-11)\n- ### Archives\n  - [June 2020](https:\/\/www.adamk.org\/2020\/06\/)\n  - [February 2020](https:\/\/www.adamk.org\/2020\/02\/)\n  - [January 2020](https:\/\/www.adamk.org\/2020\/01\/)\n  - [December 2019](https:\/\/www.adamk.org\/2019\/12\/)\n  - [November 2019](https:\/\/www.adamk.org\/2019\/11\/)\n  - [October 2019](https:\/\/www.adamk.org\/2019\/10\/)\n  - [September 2019](https:\/\/www.adamk.org\/2019\/09\/)\n  - [August 2019](https:\/\/www.adamk.org\/2019\/08\/)\n  - [July 2019](https:\/\/www.adamk.org\/2019\/07\/)\n  - [June 2019](https:\/\/www.adamk.org\/2019\/06\/)\n  - [May 2019](https:\/\/www.adamk.org\/2019\/05\/)\n  - [April 2019](https:\/\/www.adamk.org\/2019\/04\/)\n  - [March 2019](https:\/\/www.adamk.org\/2019\/03\/)\n  - [September 2013](https:\/\/www.adamk.org\/2013\/09\/)\n  - [December 2011](https:\/\/www.adamk.org\/2011\/12\/)\n  - [August 2011](https:\/\/www.adamk.org\/2011\/08\/)\n  - [June 2011](https:\/\/www.adamk.org\/2011\/06\/)\n  - [April 2011](https:\/\/www.adamk.org\/2011\/04\/)\n- ### Categories\n  - [programming](https:\/\/www.adamk.org\/category\/programming\/)\n  - [science](https:\/\/www.adamk.org\/category\/science\/)\n  - [technology](https:\/\/www.adamk.org\/category\/technology\/)\n  - [Uncategorized](https:\/\/www.adamk.org\/category\/uncategorized\/)\n- ### Meta\n  - [Log in](https:\/\/www.adamk.org\/wp-login.php)\n  - [Entries feed](https:\/\/www.adamk.org\/feed\/)\n  - [Comments feed](https:\/\/www.adamk.org\/comments\/feed\/)\n  - [WordPress.org](https:\/\/en-gb.wordpress.org\/)\n\n[adamk.org](https:\/\/www.adamk.org\/)\n\n[Proudly powered by WordPress.](https:\/\/wordpress.org\/ \"Semantic Personal Publishing Platform\")","attrs_readable_markdown":"Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph:\n\n[![](https:\/\/www.adamk.org\/wp-content\/uploads\/2019\/04\/whiteboard-bellmanford-1024x768.jpg)](https:\/\/www.adamk.org\/wp-content\/uploads\/2019\/04\/whiteboard-bellmanford.jpg)\n\nThis is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this:\n\nThe above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity:\n\nTo keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made.\n\nThis entry was posted in [programming](https:\/\/www.adamk.org\/category\/programming\/) and tagged [algorithms](https:\/\/www.adamk.org\/tag\/algorithms\/), [coding](https:\/\/www.adamk.org\/tag\/coding\/). Bookmark the [permalink](https:\/\/www.adamk.org\/shortest-path-bellman-ford-algorithm\/ \"Permalink to Shortest Path – Bellman Ford algorithm\").","meta_canonical":null}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

2 days ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.1 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://www.adamk.org/shortest-path-bellman-ford-algorithm/
Last Crawled	2026-04-15 19:09:15 (2 days ago)
First Indexed	2019-04-12 05:16:04 (7 years ago)
HTTP Status Code	200
Meta Title	Shortest Path – Bellman Ford algorithm \| adamk.org
Meta Description	null
Meta Canonical	null
Boilerpipe Text	Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph: This is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this: The above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity: To keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made. This entry was posted in programming and tagged algorithms , coding . Bookmark the permalink .
Markdown	[Skip to content](https://www.adamk.org/shortest-path-bellman-ford-algorithm/#content) [adamk.org](https://www.adamk.org/) Adam's random thoughts… ![adamk.org](https://www.adamk.org/wp-content/uploads/2011/04/earth-wp.jpg) - [Home](http://www.adamk.org/) - [xdiffr](https://www.adamk.org/xdiffr/) - [SudokuSolverX](https://www.adamk.org/sudokusolverx/) - [Algorithms](https://www.adamk.org/algorithms/) - [About](https://www.adamk.org/about/) [← Fibonacci spiral](https://www.adamk.org/fibonacci-spiral/) [Shortest Path – Dijkstra’s algorithm →](https://www.adamk.org/shortest-path-dijkstras-algorithm/) # Shortest Path – Bellman Ford algorithm Posted on [11th April 2019](https://www.adamk.org/shortest-path-bellman-ford-algorithm/ "11:58 pm") by [adam](https://www.adamk.org/author/adam/ "View all posts by adam") Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph: [![](https://www.adamk.org/wp-content/uploads/2019/04/whiteboard-bellmanford-1024x768.jpg)](https://www.adamk.org/wp-content/uploads/2019/04/whiteboard-bellmanford.jpg) This is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this: The above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity: To keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made. This entry was posted in [programming](https://www.adamk.org/category/programming/) and tagged [algorithms](https://www.adamk.org/tag/algorithms/), [coding](https://www.adamk.org/tag/coding/). Bookmark the [permalink](https://www.adamk.org/shortest-path-bellman-ford-algorithm/ "Permalink to Shortest Path – Bellman Ford algorithm"). [← Fibonacci spiral](https://www.adamk.org/fibonacci-spiral/) [Shortest Path – Dijkstra’s algorithm →](https://www.adamk.org/shortest-path-dijkstras-algorithm/) ### Leave a Reply [Cancel reply](https://www.adamk.org/shortest-path-bellman-ford-algorithm/#respond) - ### Recent Posts - [Binary Indexed Tree (Fenwick Tree)](https://www.adamk.org/binary-indexed-tree-fenwick-tree/) - [Boyer-Moore Majority Vote Algorithm](https://www.adamk.org/boyer-moore-majority-vote-algorithm/) - [Smart pointers](https://www.adamk.org/smart-pointers/) - [Binary Search](https://www.adamk.org/binary-search/) - [Leetcode 45: Jump Game II](https://www.adamk.org/leetcode-45-jump-game-ii/) - ### Recent Comments - [Leetcode 46: Permutations \\| adamk.org](https://www.adamk.org/leetcode-46-permutations/) on [Leetcode 31: Next permutation](https://www.adamk.org/leetcode-31-next-permutation/#comment-9935) - [xdiffr initial release \\| adamk.org](https://www.adamk.org/xdiffr-initial-release/) on [XDiff](https://www.adamk.org/xdiff/#comment-9672) - [the check is cut](http://www.facebook.com/hernandezru) on [Zombie ants controlled by parasite fungus](https://www.adamk.org/zombie-ants-controlled-by-parasite-fungus/#comment-13) - [Wedding ideas](http://www.weddingplannerphotography.com/) on [Zombie ants controlled by parasite fungus](https://www.adamk.org/zombie-ants-controlled-by-parasite-fungus/#comment-12) - [Douglass](http://surfmag.theblogsyndicate.com/) on [Freezing hard drive as last resort data recovery](https://www.adamk.org/freezing-hard-drive-as-last-resort-data-recovery/#comment-11) - ### Archives - [June 2020](https://www.adamk.org/2020/06/) - [February 2020](https://www.adamk.org/2020/02/) - [January 2020](https://www.adamk.org/2020/01/) - [December 2019](https://www.adamk.org/2019/12/) - [November 2019](https://www.adamk.org/2019/11/) - [October 2019](https://www.adamk.org/2019/10/) - [September 2019](https://www.adamk.org/2019/09/) - [August 2019](https://www.adamk.org/2019/08/) - [July 2019](https://www.adamk.org/2019/07/) - [June 2019](https://www.adamk.org/2019/06/) - [May 2019](https://www.adamk.org/2019/05/) - [April 2019](https://www.adamk.org/2019/04/) - [March 2019](https://www.adamk.org/2019/03/) - [September 2013](https://www.adamk.org/2013/09/) - [December 2011](https://www.adamk.org/2011/12/) - [August 2011](https://www.adamk.org/2011/08/) - [June 2011](https://www.adamk.org/2011/06/) - [April 2011](https://www.adamk.org/2011/04/) - ### Categories - [programming](https://www.adamk.org/category/programming/) - [science](https://www.adamk.org/category/science/) - [technology](https://www.adamk.org/category/technology/) - [Uncategorized](https://www.adamk.org/category/uncategorized/) - ### Meta - [Log in](https://www.adamk.org/wp-login.php) - [Entries feed](https://www.adamk.org/feed/) - [Comments feed](https://www.adamk.org/comments/feed/) - [WordPress.org](https://en-gb.wordpress.org/) [adamk.org](https://www.adamk.org/) [Proudly powered by WordPress.](https://wordpress.org/ "Semantic Personal Publishing Platform")
Readable Markdown	Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph: [![](https://www.adamk.org/wp-content/uploads/2019/04/whiteboard-bellmanford-1024x768.jpg)](https://www.adamk.org/wp-content/uploads/2019/04/whiteboard-bellmanford.jpg) This is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation of this: The above is a vertex oriented walk through the graph, where we visit each vertex and calculate the costs to every outwardly connected vertex. I have found it simpler to just walk through an array of edges, which cuts down some complexity: To keep this simple, I left out the optimisation to break out of the outer loop when no more updates are made. This entry was posted in [programming](https://www.adamk.org/category/programming/) and tagged [algorithms](https://www.adamk.org/tag/algorithms/), [coding](https://www.adamk.org/tag/coding/). Bookmark the [permalink](https://www.adamk.org/shortest-path-bellman-ford-algorithm/ "Permalink to Shortest Path – Bellman Ford algorithm").
Shard	20 (laksa)
Root Hash	12703082565510054020
Unparsed URL	org,adamk!www,/shortest-path-bellman-ford-algorithm/ s443