🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 103 (from laksa110)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa103.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, 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 int_partition_id = 10 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://www.scaler.com/topics/data-structures/bellman-ford-algorithm/\')), getAhrefsUnparsedNoserviceFromURL(\'https://www.scaler.com/topics/data-structures/bellman-ford-algorithm/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/www.scaler.com\/topics\/data-structures\/bellman-ford-algorithm\/","crawl_time":1779793724,"first_indexed_time":1647954976,"http_code":200,"src_unparsed":"com,scaler!www,\/topics\/data-structures\/bellman-ford-algorithm\/ s443","src_root_hash":"2748309851778122103","history_drop_reason":null,"meta_title":"Bellman–Ford Algorithm | Scaler Topics","meta_descriptions":["Learn about bellman ford algorithm by Scaler Topics. Bellman ford is used to calculate the shortest paths from a single source vertex to all vertices in the graph."],"meta_canonical":null,"ml_categories_json":"{\"\/Computers_and_Electronics\":645,\"\/Science\":399,\"\/Computers_and_Electronics\/Software\":337,\"\/Science\/Mathematics\":319,\"\/Computers_and_Electronics\/Software\/Educational_Software\":219}","ml_types_json":"{\"\/Article\":998,\"\/Article\/Tutorial_or_Guide\":951}","ml_intent_types_json":"{\"Informational\":999}","meta_language":"en","attrs_author":"Paras Yadav","attrs_publish_time":1640044800,"attrs_original_publish_time":1640044800,"attrs_is_republished":0,"attrs_nr_words":"1662","attrs_boilerpipe_nr_words":"1336","body_ext_links_number":8,"body_int_links_number":57,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":239,"download_ttfb_msec":235,"download_size":30052}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍

LOCATION

Host 103 · Partition 10

laksa103

2748309851778122103

📄

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://www.scaler.com/topics/data-structures/bellman-ford-algorithm/

Last Crawled

2026-05-26 11:08:44 (7 days ago)

First Indexed

2022-03-22 13:16:16 (4 years ago)

HTTP Status Code

200

Content

Meta Title

Bellman–Ford Algorithm | Scaler Topics

Meta Description

Learn about bellman ford algorithm by Scaler Topics. Bellman ford is used to calculate the shortest paths from a single source vertex to all vertices in the graph.

Meta Canonical

null

Boilerpipe Text

heavy column, fetched on demand

Markdown

heavy column, fetched on demand

Readable Markdown

heavy column, fetched on demand

ML Classification

ML Categories

/Computers_and_Electronics		64.5%
/Science		39.9%
/Computers_and_Electronics/Software		33.7%
/Science/Mathematics		31.9%
/Computers_and_Electronics/Software/Educational_Software		21.9%

Raw JSON

{
    "/Computers_and_Electronics": 645,
    "/Science": 399,
    "/Computers_and_Electronics/Software": 337,
    "/Science/Mathematics": 319,
    "/Computers_and_Electronics/Software/Educational_Software": 219
}

ML Page Types

/Article		99.8%
/Article/Tutorial_or_Guide		95.1%

Raw JSON

{
    "/Article": 998,
    "/Article/Tutorial_or_Guide": 951
}

ML Intent Types

Informational

99.9%

Raw JSON

{
    "Informational": 999
}

Content Metadata

Language

Author

Paras Yadav

Publish Time

2021-12-21 00:00:00 (4 years ago)

Original Publish Time

2021-12-21 00:00:00 (4 years ago)

Republished

Word Count (Total)

1,662

Word Count (Content)

1,336

Links

External Links

Internal Links

Technical SEO

Meta Nofollow

Meta Noarchive

JS Rendered

Redirect Target

null

Performance

Download Time (ms)

239

TTFB (ms)

235

Download Size (bytes)

30,052

Location

Host ID

103 (laksa103)

Partition ID

Root Hash

2748309851778122103

Unparsed URL

com,scaler!www,/topics/data-structures/bellman-ford-algorithm/ s443