{"entities":{"Q7361202":{"pageid":31519145,"ns":120,"title":"Item:Q7361202","lastrevid":105363989,"modified":"2026-10-07T13:35:14Z","type":"item","id":"Q7361202","labels":{"en":{"language":"en","value":"Dijkstra's Shortest Path Algorithm"}},"descriptions":{"en":{"language":"en","value":"AFP entry Dijkstra_Shortest_Path"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"dba063bcd58f0a53a4a16bcd0fde7fd46f0acbea","datavalue":{"value":"https://isa-afp.org/entries/Dijkstra_Shortest_Path.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361202$8B2D0898-0C49-4132-8BC5-254670BD8399","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ba2e2ba7c86631c6257f9147613e92ee6710f171","datavalue":{"value":{"time":"+2012-01-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361202$E6F00D88-3752-4F85-9873-94B87E3EAA39","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"2c2e340f6154b10fe565741acc55a724d9bcde73","datavalue":{"value":"Benedikt Nordhoff","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361202$67A8A3A9-6430-45F8-8AEF-AA00747AA54A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"7545c5768cca6bd4b47e52bfec18c22cb81849df","datavalue":{"value":"Peter Lammich","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361202$39228A7E-E732-4BC7-A51F-2C747BE46446","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"364d3d63429be7469a31b471429f4ec04444557e","datavalue":{"value":{"text":"Dijkstra's Shortest Path Algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361202$D9F9C3AC-EB7B-4C09-BD07-EE437DAFF03D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5352e5ab0e6cf8322f1dcdc312cf14f8fc169265","datavalue":{"value":"We implement and prove correct Dijkstra's algorithm for the single source shortest path problem, conceived in 1956 by E. Dijkstra. The algorithm is implemented using the data refinement framework for monadic, nondeterministic programs. An efficient implementation is derived using data structures from the Isabelle Collection Framework.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361202$D52CB1AE-6314-409A-80FA-027377F27327","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"e5a1ce762817aa67ba84d34579fd3b9060a2c653","datavalue":{"value":{"entity-type":"item","numeric-id":3543655,"id":"Q3543655"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$7717EA5F-EEDE-454C-AC2F-8E6433B3D1D7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2b989f45b85fa44137ad22092706b6102fd241bf","datavalue":{"value":{"entity-type":"item","numeric-id":78129,"id":"Q78129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$3EF31DBB-B3A7-4B15-8D0A-B3952AE5CBA7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"931c42c28f22f89fe1b66164f9ececc2021ac1a2","datavalue":{"value":{"entity-type":"item","numeric-id":3558332,"id":"Q3558332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$832E74CA-AA9E-4B1B-9AFF-B070D5B71502","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"22a5a326924c9f9f3cf0f5061fb0ff950ccfad0d","datavalue":{"value":{"entity-type":"item","numeric-id":5747660,"id":"Q5747660"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$29877F13-8EFF-4F2F-8E11-D3F54D096FFC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"25282e1f0c1e0eccc5ae4ce78bc688548d8c67f5","datavalue":{"value":{"entity-type":"item","numeric-id":396975,"id":"Q396975"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$4D490445-9192-4EB1-BC1F-951CDCCA4D20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"84afe353d96a988928bd5d41e96afba7e81d6980","datavalue":{"value":{"entity-type":"item","numeric-id":1600086,"id":"Q1600086"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$CE2CB534-3D0D-42DD-BEE4-C4D0C112D939","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2ced8c38baef113b32e01b72e87cf753eabeb19f","datavalue":{"value":{"entity-type":"item","numeric-id":3172801,"id":"Q3172801"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$504CFC48-C1FC-4306-88B0-E01879F35B5E","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$78157AF9-5918-47EB-B195-0DFBAFC43FF5","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"f0d6ccc9a00d2d1e3be7ec2239689671c14dec25","datavalue":{"value":{"entity-type":"item","numeric-id":7361918,"id":"Q7361918"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$929E1908-D65C-45E9-8BE6-B029FD7DAB7B","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"0cb214ba14504ce52502380598f813a3d010fff5","datavalue":{"value":{"entity-type":"item","numeric-id":7360777,"id":"Q7360777"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$A5FC9A6C-CDD5-4E54-A628-DB30A92FA04E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361202$2C967D54-333E-442F-865C-1CB05F37F7D1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dijkstra's Shortest Path Algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Dijkstra%27s_Shortest_Path_Algorithm"}}}}}