🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 141 (from laksa166)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa141.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, ml_categories_json AS ml_categories_json, ml_types_json AS ml_types_json, ml_intent_types_json AS ml_intent_types_json, meta_language AS meta_language, attrs_author AS attrs_author, ifNull(toUnixTimestamp(attrs_publish_time), 0) AS attrs_publish_time, ifNull(toUnixTimestamp(attrs_original_publish_time), 0) AS attrs_original_publish_time, ifNull(attrs_is_republished, 0) AS attrs_is_republished, ifNull(attrs_nr_words, 0) AS attrs_nr_words, ifNull(attrs_boilerpipe_nr_words, 0) AS attrs_boilerpipe_nr_words, ifNull(body_ext_links_number, 0) AS body_ext_links_number, ifNull(body_int_links_number, 0) AS body_int_links_number, ifNull(meta_nofollow, 0) AS meta_nofollow, ifNull(meta_noarchive, 0) AS meta_noarchive, ifNull(props_was_rendered, 0) AS props_was_rendered, ifNull(src_redirect, \'\') AS src_redirect, ifNull(download_time_msec, 0) AS download_time_msec, ifNull(download_ttfb_msec, 0) AS download_ttfb_msec, ifNull(download_size, 0) AS download_size FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge\')), getAhrefsUnparsedNoserviceFromURL(\'https://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/takeuforward.org\/data-structure\/bellman-ford-algorithm-shortest-distance-with-negative-edge","crawl_time":1776202441,"first_indexed_time":1668667886,"http_code":200,"src_unparsed":"org,takeuforward!\/data-structure\/bellman-ford-algorithm-shortest-distance-with-negative-edge s443","src_root_hash":"1544422806028697341","history_drop_reason":null,"meta_title":"Bellman-Ford Algorithm - Shortest Distance with Negative Edge - Tutorial","meta_descriptions":["Detailed solution for Bellman-Ford Algorithm - Shortest Distance with Negative Edge - va Problem Statement: Given a weighted directed graph with negative edge weights with n nodes and m edges. Nodes are labeled from 0 to n-1, the task is to find the shortest distance from the source..."],"attrs_boilerpipe_text":"Bellman-Ford Algorithm - Shortest Distance with Negative Edge - Tutorial","attrs_markdown":"![takeUforward](https:\/\/takeuforward.org\/SecondaryLogoWO.png)\n\n![takeUforward](https:\/\/takeuforward.org\/SecondaryLogoWO.png)\n\n[![TakeUForward logo](https:\/\/static.takeuforward.org\/content\/tuf_logo_F-nFV4asTo)](https:\/\/takeuforward.org\/)\n\n[Home](https:\/\/takeuforward.org\/home)\n\n[Plus](https:\/\/takeuforward.org\/plus\/home)\n\n[Track](https:\/\/takeuforward.org\/data-structure\/bellman-ford-algorithm-shortest-distance-with-negative-edge)\n\n## Command Palette\nSearch for a command to run...\n\n[![TakeUForward logo](https:\/\/static.takeuforward.org\/content\/tuf_logo_F-nFV4asTo)](https:\/\/takeuforward.org\/)\n\n[Home](https:\/\/takeuforward.org\/home)\n\n[Plus](https:\/\/takeuforward.org\/plus\/home)\n\n[Track](https:\/\/takeuforward.org\/data-structure\/bellman-ford-algorithm-shortest-distance-with-negative-edge)\n\n## Command Palette\nSearch for a command to run...\n\n[![TakeUForward logo](https:\/\/static.takeuforward.org\/content\/tuf_logo_F-nFV4asTo)](https:\/\/takeuforward.org\/)\n\nBlog\n\nDiscussion\n\n[![Logo](https:\/\/takeuforward.org\/images\/TUFPlusLogoO.png)Solve](https:\/\/takeuforward.org\/plus\/dsa\/problems\/bellman-ford-algorithm)\n\n[![Logo](https:\/\/takeuforward.org\/images\/TUFPlusLogoO.png)Editorial](https:\/\/takeuforward.org\/plus\/dsa\/problems\/bellman-ford-algorithm?tab=editorial)\n\n[![YouTube](https:\/\/takeuforward.org\/images\/sheets\/youtube.svg)](https:\/\/www.youtube.com\/watch?v=75yC1vbS8S8)\n\n[![TakeUForward logo](https:\/\/static.takeuforward.org\/content\/tuf_logo_F-nFV4asTo)](https:\/\/takeuforward.org\/)\n\nBlog\n\nDiscussion\n\n[![Logo](https:\/\/takeuforward.org\/images\/TUFPlusLogoO.png)Solve](https:\/\/takeuforward.org\/plus\/dsa\/problems\/bellman-ford-algorithm)\n\n[![Logo](https:\/\/takeuforward.org\/images\/TUFPlusLogoO.png)Editorial](https:\/\/takeuforward.org\/plus\/dsa\/problems\/bellman-ford-algorithm?tab=editorial)\n\n[![YouTube](https:\/\/takeuforward.org\/images\/sheets\/youtube.svg)](https:\/\/www.youtube.com\/watch?v=75yC1vbS8S8)","attrs_readable_markdown":"![takeUforward](https:\/\/takeuforward.org\/SecondaryLogoWO.png)","meta_canonical":null,"ml_categories_json":"","ml_types_json":"","ml_intent_types_json":"","meta_language":"en","attrs_author":null,"attrs_publish_time":0,"attrs_original_publish_time":1668667886,"attrs_is_republished":0,"attrs_nr_words":"40","attrs_boilerpipe_nr_words":"10","body_ext_links_number":1,"body_int_links_number":5,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":660,"download_ttfb_msec":287,"download_size":19973}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

7 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.3 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://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge
Last Crawled	2026-04-14 21:34:01 (7 days ago)
First Indexed	2022-11-17 06:51:26 (3 years ago)
HTTP Status Code	200
Content
Meta Title	Bellman-Ford Algorithm - Shortest Distance with Negative Edge - Tutorial
Meta Description	Detailed solution for Bellman-Ford Algorithm - Shortest Distance with Negative Edge - va Problem Statement: Given a weighted directed graph with negative edge weights with n nodes and m edges. Nodes are labeled from 0 to n-1, the task is to find the shortest distance from the source...
Meta Canonical	null
Boilerpipe Text	Bellman-Ford Algorithm - Shortest Distance with Negative Edge - Tutorial
Markdown	![takeUforward](https://takeuforward.org/SecondaryLogoWO.png) ![takeUforward](https://takeuforward.org/SecondaryLogoWO.png) [![TakeUForward logo](https://static.takeuforward.org/content/tuf_logo_F-nFV4asTo)](https://takeuforward.org/) [Home](https://takeuforward.org/home) [Plus](https://takeuforward.org/plus/home) [Track](https://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge) ## Command Palette Search for a command to run... [![TakeUForward logo](https://static.takeuforward.org/content/tuf_logo_F-nFV4asTo)](https://takeuforward.org/) [Home](https://takeuforward.org/home) [Plus](https://takeuforward.org/plus/home) [Track](https://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge) ## Command Palette Search for a command to run... [![TakeUForward logo](https://static.takeuforward.org/content/tuf_logo_F-nFV4asTo)](https://takeuforward.org/) Blog Discussion [![Logo](https://takeuforward.org/images/TUFPlusLogoO.png)Solve](https://takeuforward.org/plus/dsa/problems/bellman-ford-algorithm) [![Logo](https://takeuforward.org/images/TUFPlusLogoO.png)Editorial](https://takeuforward.org/plus/dsa/problems/bellman-ford-algorithm?tab=editorial) [![YouTube](https://takeuforward.org/images/sheets/youtube.svg)](https://www.youtube.com/watch?v=75yC1vbS8S8) [![TakeUForward logo](https://static.takeuforward.org/content/tuf_logo_F-nFV4asTo)](https://takeuforward.org/) Blog Discussion [![Logo](https://takeuforward.org/images/TUFPlusLogoO.png)Solve](https://takeuforward.org/plus/dsa/problems/bellman-ford-algorithm) [![Logo](https://takeuforward.org/images/TUFPlusLogoO.png)Editorial](https://takeuforward.org/plus/dsa/problems/bellman-ford-algorithm?tab=editorial) [![YouTube](https://takeuforward.org/images/sheets/youtube.svg)](https://www.youtube.com/watch?v=75yC1vbS8S8)
Readable Markdown	![takeUforward](https://takeuforward.org/SecondaryLogoWO.png)
ML Classification
ML Categories	null
ML Page Types	null
ML Intent Types	null
Content Metadata
Language	en
Author	null
Publish Time	not set
Original Publish Time	2022-11-17 06:51:26 (3 years ago)
Republished	No
Word Count (Total)	40
Word Count (Content)	10
Links
External Links	1
Internal Links	5
Technical SEO
Meta Nofollow	No
Meta Noarchive	No
JS Rendered	No
Redirect Target	null
Performance
Download Time (ms)	660
TTFB (ms)	287
Download Size (bytes)	19,973
Shard	141 (laksa)
Root Hash	1544422806028697341
Unparsed URL	org,takeuforward!/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge s443