{"openapi":"3.1.0","info":{"title":"Huffman Coding Visualizer","description":"Builds a Huffman tree from your text step by step, animating each node merge, and shows the resulting binary code per symbol plus the compression ratio achieved.","version":"1.0"},"servers":[{"url":"https://dabbled.ai"}],"paths":{"/apps/huffman-coding-visualizer":{"get":{"operationId":"huffmanCodingVisualizer","summary":"Builds a Huffman tree from your text step by step, animating each node merge, and shows the resulting binary code per symbol plus the compression ratio achieved.","parameters":[{"name":"input_text","in":"query","required":true,"description":"Text to encode","schema":{"type":"string"}},{"name":"case_sensitive","in":"query","required":false,"description":"Treat upper/lower case as distinct symbols","schema":{"type":"boolean"}},{"name":"include_whitespace","in":"query","required":false,"description":"Include whitespace characters","schema":{"type":"boolean"}},{"name":"granularity","in":"query","required":false,"description":"Symbol granularity","schema":{"type":"string","enum":["Character","Byte"]}},{"name":"bits_per_symbol","in":"query","required":false,"description":"Bits per original symbol","schema":{"type":"number"}},{"name":"include_header","in":"query","required":false,"description":"Include code-table/header size in ratio","schema":{"type":"boolean"}},{"name":"deterministic","in":"query","required":false,"description":"Deterministic tie-breaking","schema":{"type":"boolean"}}],"responses":{"200":{"description":"Rendered app reflecting the given inputs."}}}}}}