🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 139 (from laksa084)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa139.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://algorithms.discrete.ma.tum.de/spp/bellman-ford/\')), getAhrefsUnparsedNoserviceFromURL(\'https://algorithms.discrete.ma.tum.de/spp/bellman-ford/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/algorithms.discrete.ma.tum.de\/spp\/bellman-ford\/","crawl_time":1770941570,"first_indexed_time":0,"http_code":200,"src_unparsed":"de,tum!ma,discrete,algorithms,\/spp\/bellman-ford\/ s443","src_root_hash":"17669990152211228739","history_drop_reason":null,"meta_title":"Bellman-Ford Algorithm","meta_descriptions":[],"attrs_boilerpipe_text":"Discrete Mathematics, Optimization, and Convexity\nDepartment of Mathematics\nTechnical University of Munich\nTUM_Web_Logo_blau\nTUM\nSpanning Trees\nPrim's Algorithm\nKruskal's Algorithm\nMatching\nBlossom Algorithm\nHopcroft-Karp\nHungarian Method\nNetwork Flow\nCycle Cancelling\nFord-Fulkerson\nRouting\nChinese Postman\nHierholzer's Algorithm\nTSP Game\nShortest Paths\nA* Algorithm\nBellman-Ford\nDijsktra's Algorithm\nFloyd-Warshall\nEN\nDE\nHome\nShortest Paths\nBellman-Ford Algorithm\n© Department of Mathematics\nData Protection Declaration\nLegal Notice & Imprint","attrs_markdown":"[Discrete Mathematics, Optimization, and Convexity](https:\/\/discrete.ma.tum.de\/ \"discrete.ma.tum.de\")  \n [Department of Mathematics](https:\/\/www.ma.tum.de\/en \"www.ma.tum.de\")  \n [Technical University of Munich](https:\/\/www.tum.de\/en \"www.tum.de\")\n\n[TUM](https:\/\/www.tum.de\/ \"www.tum.de\")\n\n- [Spanning Trees](https:\/\/algorithms.discrete.ma.tum.de\/mst\/)\n  - [Prim's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/mst\/prim)\n  - [Kruskal's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/mst\/kruskal)\n- [Matching](https:\/\/algorithms.discrete.ma.tum.de\/matching\/)\n  - [Blossom Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/matching\/blossom)\n  - [Hopcroft-Karp](https:\/\/algorithms.discrete.ma.tum.de\/matching\/hopcroft-karp)\n  - [Hungarian Method](https:\/\/algorithms.discrete.ma.tum.de\/matching\/hungarian-method)\n- [Network Flow](https:\/\/algorithms.discrete.ma.tum.de\/flow\/)\n  - [Cycle Cancelling](https:\/\/algorithms.discrete.ma.tum.de\/flow\/cycle-cancelling)\n  - [Ford-Fulkerson](https:\/\/algorithms.discrete.ma.tum.de\/flow\/ford-fulkerson)\n- [Routing](https:\/\/algorithms.discrete.ma.tum.de\/routing\/)\n  - [Chinese Postman](https:\/\/algorithms.discrete.ma.tum.de\/routing\/chinese-postman)\n  - [Hierholzer's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/routing\/hierholzer)\n  - [TSP Game](https:\/\/algorithms.discrete.ma.tum.de\/routing\/tsp)\n- [Shortest Paths](https:\/\/algorithms.discrete.ma.tum.de\/spp\/)\n  - [A\\* Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/spp\/astar)\n  - [Bellman-Ford](https:\/\/algorithms.discrete.ma.tum.de\/spp\/bellman-ford)\n  - [Dijsktra's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/spp\/dijsktra)\n  - [Floyd-Warshall](https:\/\/algorithms.discrete.ma.tum.de\/spp\/floyd-warshall)\n\n- [EN](http:\/\/algorithms.discrete.ma.tum.de\/spp\/bellman-ford\/)\n- [DE](http:\/\/algorithms.discrete.ma.tum.de\/de\/spp\/bellman-ford\/)\n\n1. [Home](http:\/\/algorithms.discrete.ma.tum.de\/)\n2. [Shortest Paths](http:\/\/algorithms.discrete.ma.tum.de\/spp\/)\n3. Bellman-Ford Algorithm\n# Bellman-Ford Algorithm\n- [© Department of Mathematics](https:\/\/www.ma.tum.de\/)\n\n- [Data Protection Declaration](https:\/\/discrete.ma.tum.de\/data-protection-declaration.html)\n- [Legal Notice & Imprint](https:\/\/discrete.ma.tum.de\/legal-notice.html)","attrs_readable_markdown":"[Discrete Mathematics, Optimization, and Convexity](https:\/\/discrete.ma.tum.de\/ \"discrete.ma.tum.de\")  \n [Department of Mathematics](https:\/\/www.ma.tum.de\/en \"www.ma.tum.de\")  \n [Technical University of Munich](https:\/\/www.tum.de\/en \"www.tum.de\")\n\n[TUM](https:\/\/www.tum.de\/ \"www.tum.de\")\n\n- [Spanning Trees](https:\/\/algorithms.discrete.ma.tum.de\/mst\/)\n  - [Prim's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/mst\/prim)\n  - [Kruskal's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/mst\/kruskal)\n- [Matching](https:\/\/algorithms.discrete.ma.tum.de\/matching\/)\n  - [Blossom Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/matching\/blossom)\n  - [Hopcroft-Karp](https:\/\/algorithms.discrete.ma.tum.de\/matching\/hopcroft-karp)\n  - [Hungarian Method](https:\/\/algorithms.discrete.ma.tum.de\/matching\/hungarian-method)\n- [Network Flow](https:\/\/algorithms.discrete.ma.tum.de\/flow\/)\n  - [Cycle Cancelling](https:\/\/algorithms.discrete.ma.tum.de\/flow\/cycle-cancelling)\n  - [Ford-Fulkerson](https:\/\/algorithms.discrete.ma.tum.de\/flow\/ford-fulkerson)\n- [Routing](https:\/\/algorithms.discrete.ma.tum.de\/routing\/)\n  - [Chinese Postman](https:\/\/algorithms.discrete.ma.tum.de\/routing\/chinese-postman)\n  - [Hierholzer's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/routing\/hierholzer)\n  - [TSP Game](https:\/\/algorithms.discrete.ma.tum.de\/routing\/tsp)\n- [Shortest Paths](https:\/\/algorithms.discrete.ma.tum.de\/spp\/)\n  - [A\\* Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/spp\/astar)\n  - [Bellman-Ford](https:\/\/algorithms.discrete.ma.tum.de\/spp\/bellman-ford)\n  - [Dijsktra's Algorithm](https:\/\/algorithms.discrete.ma.tum.de\/spp\/dijsktra)\n  - [Floyd-Warshall](https:\/\/algorithms.discrete.ma.tum.de\/spp\/floyd-warshall)\n\n- [EN](http:\/\/algorithms.discrete.ma.tum.de\/spp\/bellman-ford\/)\n- [DE](http:\/\/algorithms.discrete.ma.tum.de\/de\/spp\/bellman-ford\/)\n\n1. [Home](http:\/\/algorithms.discrete.ma.tum.de\/)\n2. [Shortest Paths](http:\/\/algorithms.discrete.ma.tum.de\/spp\/)\n3. Bellman-Ford Algorithm\n\n- [© Department of Mathematics](https:\/\/www.ma.tum.de\/)\n\n- [Data Protection Declaration](https:\/\/discrete.ma.tum.de\/data-protection-declaration.html)\n- [Legal Notice & Imprint](https:\/\/discrete.ma.tum.de\/legal-notice.html)","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

1 month 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`	1.9 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://algorithms.discrete.ma.tum.de/spp/bellman-ford/
Last Crawled	2026-02-13 00:12:50 (1 month ago)
First Indexed	not set
HTTP Status Code	200
Meta Title	Bellman-Ford Algorithm
Meta Description	null
Meta Canonical	null
Boilerpipe Text	Discrete Mathematics, Optimization, and Convexity Department of Mathematics Technical University of Munich TUM_Web_Logo_blau TUM Spanning Trees Prim's Algorithm Kruskal's Algorithm Matching Blossom Algorithm Hopcroft-Karp Hungarian Method Network Flow Cycle Cancelling Ford-Fulkerson Routing Chinese Postman Hierholzer's Algorithm TSP Game Shortest Paths A* Algorithm Bellman-Ford Dijsktra's Algorithm Floyd-Warshall EN DE Home Shortest Paths Bellman-Ford Algorithm © Department of Mathematics Data Protection Declaration Legal Notice & Imprint
Markdown	[Discrete Mathematics, Optimization, and Convexity](https://discrete.ma.tum.de/ "discrete.ma.tum.de") [Department of Mathematics](https://www.ma.tum.de/en "www.ma.tum.de") [Technical University of Munich](https://www.tum.de/en "www.tum.de") [TUM](https://www.tum.de/ "www.tum.de") - [Spanning Trees](https://algorithms.discrete.ma.tum.de/mst/) - [Prim's Algorithm](https://algorithms.discrete.ma.tum.de/mst/prim) - [Kruskal's Algorithm](https://algorithms.discrete.ma.tum.de/mst/kruskal) - [Matching](https://algorithms.discrete.ma.tum.de/matching/) - [Blossom Algorithm](https://algorithms.discrete.ma.tum.de/matching/blossom) - [Hopcroft-Karp](https://algorithms.discrete.ma.tum.de/matching/hopcroft-karp) - [Hungarian Method](https://algorithms.discrete.ma.tum.de/matching/hungarian-method) - [Network Flow](https://algorithms.discrete.ma.tum.de/flow/) - [Cycle Cancelling](https://algorithms.discrete.ma.tum.de/flow/cycle-cancelling) - [Ford-Fulkerson](https://algorithms.discrete.ma.tum.de/flow/ford-fulkerson) - [Routing](https://algorithms.discrete.ma.tum.de/routing/) - [Chinese Postman](https://algorithms.discrete.ma.tum.de/routing/chinese-postman) - [Hierholzer's Algorithm](https://algorithms.discrete.ma.tum.de/routing/hierholzer) - [TSP Game](https://algorithms.discrete.ma.tum.de/routing/tsp) - [Shortest Paths](https://algorithms.discrete.ma.tum.de/spp/) - [A\* Algorithm](https://algorithms.discrete.ma.tum.de/spp/astar) - [Bellman-Ford](https://algorithms.discrete.ma.tum.de/spp/bellman-ford) - [Dijsktra's Algorithm](https://algorithms.discrete.ma.tum.de/spp/dijsktra) - [Floyd-Warshall](https://algorithms.discrete.ma.tum.de/spp/floyd-warshall) - [EN](http://algorithms.discrete.ma.tum.de/spp/bellman-ford/) - [DE](http://algorithms.discrete.ma.tum.de/de/spp/bellman-ford/) 1. [Home](http://algorithms.discrete.ma.tum.de/) 2. [Shortest Paths](http://algorithms.discrete.ma.tum.de/spp/) 3. Bellman-Ford Algorithm # Bellman-Ford Algorithm - [© Department of Mathematics](https://www.ma.tum.de/) - [Data Protection Declaration](https://discrete.ma.tum.de/data-protection-declaration.html) - [Legal Notice & Imprint](https://discrete.ma.tum.de/legal-notice.html)
Readable Markdown	[Discrete Mathematics, Optimization, and Convexity](https://discrete.ma.tum.de/ "discrete.ma.tum.de") [Department of Mathematics](https://www.ma.tum.de/en "www.ma.tum.de") [Technical University of Munich](https://www.tum.de/en "www.tum.de") [TUM](https://www.tum.de/ "www.tum.de") - [Spanning Trees](https://algorithms.discrete.ma.tum.de/mst/) - [Prim's Algorithm](https://algorithms.discrete.ma.tum.de/mst/prim) - [Kruskal's Algorithm](https://algorithms.discrete.ma.tum.de/mst/kruskal) - [Matching](https://algorithms.discrete.ma.tum.de/matching/) - [Blossom Algorithm](https://algorithms.discrete.ma.tum.de/matching/blossom) - [Hopcroft-Karp](https://algorithms.discrete.ma.tum.de/matching/hopcroft-karp) - [Hungarian Method](https://algorithms.discrete.ma.tum.de/matching/hungarian-method) - [Network Flow](https://algorithms.discrete.ma.tum.de/flow/) - [Cycle Cancelling](https://algorithms.discrete.ma.tum.de/flow/cycle-cancelling) - [Ford-Fulkerson](https://algorithms.discrete.ma.tum.de/flow/ford-fulkerson) - [Routing](https://algorithms.discrete.ma.tum.de/routing/) - [Chinese Postman](https://algorithms.discrete.ma.tum.de/routing/chinese-postman) - [Hierholzer's Algorithm](https://algorithms.discrete.ma.tum.de/routing/hierholzer) - [TSP Game](https://algorithms.discrete.ma.tum.de/routing/tsp) - [Shortest Paths](https://algorithms.discrete.ma.tum.de/spp/) - [A\* Algorithm](https://algorithms.discrete.ma.tum.de/spp/astar) - [Bellman-Ford](https://algorithms.discrete.ma.tum.de/spp/bellman-ford) - [Dijsktra's Algorithm](https://algorithms.discrete.ma.tum.de/spp/dijsktra) - [Floyd-Warshall](https://algorithms.discrete.ma.tum.de/spp/floyd-warshall) - [EN](http://algorithms.discrete.ma.tum.de/spp/bellman-ford/) - [DE](http://algorithms.discrete.ma.tum.de/de/spp/bellman-ford/) 1. [Home](http://algorithms.discrete.ma.tum.de/) 2. [Shortest Paths](http://algorithms.discrete.ma.tum.de/spp/) 3. Bellman-Ford Algorithm - [© Department of Mathematics](https://www.ma.tum.de/) - [Data Protection Declaration](https://discrete.ma.tum.de/data-protection-declaration.html) - [Legal Notice & Imprint](https://discrete.ma.tum.de/legal-notice.html)
Shard	139 (laksa)
Root Hash	17669990152211228739
Unparsed URL	de,tum!ma,discrete,algorithms,/spp/bellman-ford/ s443