{"entities":{"Q6429957":{"pageid":13562978,"ns":120,"title":"Item:Q6429957","lastrevid":103128947,"modified":"2026-06-06T06:21:57Z","type":"item","id":"Q6429957","labels":{"en":{"language":"en","value":"A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900584269"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429957$9DF7661C-88B8-4727-8143-6747DC3EFAC6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e43f376ae9ba886450e46ec4b7b364d7cf7e404e","datavalue":{"value":{"time":"+2023-03-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6429957$7459EF81-85C0-4047-9B67-CD60814665A8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2bf2da5d5ba276f362050efd7481be530b78fd88","datavalue":{"value":{"entity-type":"item","numeric-id":336953,"id":"Q336953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429957$AFF97827-2F19-461E-B19B-9195BAACC971","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6d70806b68c1b9c1586420e223fe70c55ffc29e5","datavalue":{"value":"900584269","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6429957$B1BB37F4-06DC-435A-A072-EE2849FADA78","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429957$599684B4-ADB2-4B11-845F-17CBC13495AF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Comparison_of_Dijkstra%27s_Algorithm_Using_Fibonacci_Heaps,_Binary_Heaps,_and_Self-Balancing_Binary_Trees"}}}}}