{"entities":{"Q7361009":{"pageid":31518566,"ns":120,"title":"Item:Q7361009","lastrevid":105362390,"modified":"2026-10-07T13:34:12Z","type":"item","id":"Q7361009","labels":{"en":{"language":"en","value":"Kruskal's Algorithm for Minimum Spanning Forest"}},"descriptions":{"en":{"language":"en","value":"AFP entry Kruskal"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"af2ae1a49f15b3a67a00d62fed85fe8bbcecf6b8","datavalue":{"value":"https://isa-afp.org/entries/Kruskal.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361009$BA644EBB-143B-493B-BA55-2D40525B5AF6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d3988244ea333fe3befee59d428db74e7ba16624","datavalue":{"value":{"time":"+2019-02-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361009$D00B2689-F327-4875-BE73-D96003EB9E7E","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"02a0004599e94931eff0c15dfad08c7ac7fe5d28","datavalue":{"value":"Maximilian P. L. Haslbeck","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361009$E36DE3D3-AD99-436F-BE27-26BD7D23FFD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"7545c5768cca6bd4b47e52bfec18c22cb81849df","datavalue":{"value":"Peter Lammich","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361009$88375164-4101-4607-BD92-390871FA63E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"45d7929f672ae1b6d3e580a0748d3bc32288dd0f","datavalue":{"value":"Julian Biendarra","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361009$958825EA-136A-43DA-A922-5C2776D270EC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5541b900dc0a274010c95ee8bcb8f7ad64493f7a","datavalue":{"value":{"text":"Kruskal's Algorithm for Minimum Spanning Forest","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361009$D003BD55-416B-4A0A-81B5-98AC9F2A0B16","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a81d7ace8dbb492ba68ac6662a4786ffacbbfab4","datavalue":{"value":"This Isabelle/HOL formalization defines a greedy algorithm for finding a minimum weight basis on a weighted matroid and proves its correctness. This algorithm is an abstract version of Kruskal's algorithm. We interpret the abstract algorithm for the cycle matroid (i.e. forests in a graph) and refine it to imperative executable code using an efficient union-find data structure. Our formalization can be instantiated for different graph representations. We provide instantiations for undirected graphs and symmetric directed graphs.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361009$A99A4B23-B1F3-47E8-838D-F3B37D26AD29","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":"Q7361009$C092FE1E-8A07-4FA4-A05F-8DCE7D29BBC1","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":"Q7361009$A710A46F-AC7E-4E6B-B19A-55EA1D63211C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"c23d20508b8c15340ca98a5687cc505209d57285","datavalue":{"value":{"entity-type":"item","numeric-id":7361718,"id":"Q7361718"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361009$9604A564-BAF0-4D61-B28B-70910C06057D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"6df1e1600a3acc40d1b0a9c9cf7cbc177462ddf9","datavalue":{"value":{"entity-type":"item","numeric-id":7361373,"id":"Q7361373"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361009$4B7BFE21-4907-4DC6-AEA5-6C84C77F34FB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"8abf13f6ac778743b812d2b96e5b400a9714604e","datavalue":{"value":{"entity-type":"item","numeric-id":7361144,"id":"Q7361144"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361009$3C0BA442-ECAA-4373-955B-FECE45D6CFF0","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":"Q7361009$1EB12536-D9F2-4080-99DD-4638900D3FA5","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":"Q7361009$33AD5107-ED29-47AE-B51F-1D3DDCCC39BD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Kruskal's Algorithm for Minimum Spanning Forest","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Kruskal%27s_Algorithm_for_Minimum_Spanning_Forest"}}}}}