{"id":"url-frontier-strategy-via-sequence-sign","text":"BFS vs DFS is implemented by flipping the sign of the sequence number in the heapq min-heap — ascending for BFS (FIFO), negated for DFS (LIFO) — not by swapping data structures.","truth_value":"IN","source":"entries/2026/06/05/web-crawler-web_crawler.md","source_url":"","source_hash":"","justifications":[],"dependents":["heap-sign-negation-repurposes-min-heap"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"url-frontier-strategy-via-sequence-sign","truth_value":"IN","reason":"premise"}]}}