ℹ️ Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | PASS | download_stamp > now() - 6 MONTH | 0.6 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 |
| Property | Value | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| URL | https://www.c-sharpcorner.com/article/bellman-ford-algorithm/ | |||||||||
| Last Crawled | 2026-05-16 02:04:41 (18 days ago) | |||||||||
| First Indexed | 2023-10-23 13:31:55 (2 years ago) | |||||||||
| HTTP Status Code | 200 | |||||||||
| Content | ||||||||||
| Meta Title | Bellman Ford Algorithm | |||||||||
| Meta Description | This C# implementation of the Bellman-Ford algorithm computes shortest paths in weighted graphs. It uses classes for edges and graphs and checks for negative weight cycles efficiently. | |||||||||
| 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 |
Raw JSON{
"/Computers_and_Electronics": 974,
"/Computers_and_Electronics/Programming": 896,
"/Computers_and_Electronics/Programming/C_and_C++": 418
} | |||||||||
| ML Page Types |
Raw JSON{
"/Article": 901,
"/Article/Tutorial_or_Guide": 848
} | |||||||||
| ML Intent Types |
Raw JSON{
"Informational": 994
} | |||||||||
| Content Metadata | ||||||||||
| Language | en | |||||||||
| Author | Rajiv Singh | |||||||||
| Publish Time | not set | |||||||||
| Original Publish Time | 2023-10-23 13:31:55 (2 years ago) | |||||||||
| Republished | No | |||||||||
| Word Count (Total) | 1,313 | |||||||||
| Word Count (Content) | 1,136 | |||||||||
| Links | ||||||||||
| External Links | 42 | |||||||||
| Internal Links | 91 | |||||||||
| Technical SEO | ||||||||||
| Meta Nofollow | No | |||||||||
| Meta Noarchive | No | |||||||||
| JS Rendered | Yes | |||||||||
| Redirect Target | null | |||||||||
| Performance | ||||||||||
| Download Time (ms) | 1,292 | |||||||||
| TTFB (ms) | 1,261 | |||||||||
| Download Size (bytes) | 59,338 | |||||||||
| Location | ||||||||||
| Host ID | 2 (laksa002) | |||||||||
| Partition ID | 99 | |||||||||
| Root Hash | 5302293097463619802 | |||||||||
| Unparsed URL | com,c-sharpcorner!www,/article/bellman-ford-algorithm/ s443 | |||||||||