{"entities":{"Q916679":{"pageid":918527,"ns":120,"title":"Item:Q916679","lastrevid":65358498,"modified":"2026-04-12T02:03:01Z","type":"item","id":"Q916679","labels":{"en":{"language":"en","value":"An algorithm to find all paths between two nodes in a graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4154482"}},"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":"Q916679$4CAC43C9-1C6A-4F04-B297-5A87D9E1A009","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b712e459ce4ffe3f9ba4f5655f1328a691cd65c5","datavalue":{"value":{"text":"An algorithm to find all paths between two nodes in a graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q916679$B0927F6F-98FF-4297-A7FB-BBB2CB1B73A7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c5a110ede14f0fe5e31cc0d7be3a7f08a10104ae","datavalue":{"value":"0704.05033","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$EC190145-9626-4DA7-8309-E462304AA35B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c6f4a7a65bd37d519f2cb231c73b725996eb14c7","datavalue":{"value":"10.1016/0021-9991(90)90235-S","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$CDD6E82E-B923-4153-88FD-518638891D02","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d56612cb84f7069100c4cabafc4cc7f11973342","datavalue":{"value":{"entity-type":"item","numeric-id":914554,"id":"Q914554"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q916679$93295F61-66EF-45A4-9B62-07EB2B2A1120","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6cceddc06ad0ad76fac52687780769138ba9c5f9","datavalue":{"value":{"entity-type":"item","numeric-id":164235,"id":"Q164235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q916679$84666506-06C5-457B-A768-EEEC60BE26A7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"70d2fbf8bcd48a5ca1ac752985098b379d0dbb65","datavalue":{"value":{"time":"+1990-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q916679$675E3663-0735-4EBC-A113-938722D43446","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"d2c2455851df24e2cd64172af35ad7a5c2afa9c4","datavalue":{"value":"In this note the authors present an algorithm for finding all the paths between two nodes in a graph. The algorithm is a well-known application of the depth-first search strategy and the authors report on some simulations they performed (on aqueous systems) using several kinds of computer systems.","type":"string"},"datatype":"string"},"type":"statement","id":"Q916679$E63851EF-D3EC-4B73-9CFA-A5B4A117DC5F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$3ECEB1A7-15FE-4880-8949-6658444590F5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$96D1360E-9420-4EE2-B404-437512A6B1DC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"75f1cb47a8d60ee2694a8d6164922602fdb39832","datavalue":{"value":"4154482","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$7166BA71-CF55-47E1-86AF-7CD729DC9D37","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q916679$FF7FFCE0-77B7-4874-B7C9-7DA497420F99","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"27b0d4486a8ad8b90e8cfc4d27cbc992b2b3c992","datavalue":{"value":"finding all the paths between two nodes in a graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q916679$E3444D7F-9F9A-4177-A7D3-1981CBD7D698","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c6face949411ba012398a60ca5a40c69df448333","datavalue":{"value":"simulations","type":"string"},"datatype":"string"},"type":"statement","id":"Q916679$DC1D9EB9-2E5A-4449-AB75-0E5D55F4FA29","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"5f31ac98d3fe5038c5e97d9212ce58abe4eabf9f","datavalue":{"value":"Q60179668","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q916679$A2826B3B-7818-4233-BA13-DF97E8CDAB2D","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"cb3a3ba65440da04d49f30062ed2e12f784ddb41","datavalue":{"value":{"entity-type":"item","numeric-id":235683,"id":"Q235683"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q916679$C5774EBF-9FA0-4EA1-A705-2B5ABDCA8A79","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":"Q916679$F5E90011-E33C-4A87-AED6-96F8CC425638","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"4bd71eb1723437ee0adc143e545411b8b1254c34","datavalue":{"value":{"entity-type":"item","numeric-id":3731041,"id":"Q3731041"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q916679$B12303F7-D429-41F6-A3A4-8D72D17318ED","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6117dee2271ec7abdb8223bce0217a25ec0707f5","datavalue":{"value":{"entity-type":"item","numeric-id":4297298,"id":"Q4297298"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"58c678d99c83ee8f6ac98baf43593d073b468aa5","datavalue":{"value":{"amount":"+0.7299227714538574","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q916679$D6FA3D2D-392D-4FF2-AAFC-664690D96DC0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f173941a44cfebc9e8104e6708ce0186003557dc","datavalue":{"value":{"entity-type":"item","numeric-id":690196,"id":"Q690196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4705b0d8830c8d6d516d12048ceebe2451e49670","datavalue":{"value":{"amount":"+0.7256354689598083","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q916679$62022BAE-3EF0-4C84-84BE-61EF4C41492C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"153fd4743b1dd132db2be482f56bca477fa146d2","datavalue":{"value":{"entity-type":"item","numeric-id":1112621,"id":"Q1112621"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8d8d55d948a0403b10604f9e64fbc0db3caa5175","datavalue":{"value":{"amount":"+0.722893476486206","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q916679$25759187-B7F8-4644-9DC6-90159B4C7ED2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"212f8ef244bc5a3717f6591d66f26bf456850a3f","datavalue":{"value":{"entity-type":"item","numeric-id":2263347,"id":"Q2263347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6c6b36fc7cc19bf4e89ffa2ec4676ac921f3af54","datavalue":{"value":{"amount":"+0.7175878882408142","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q916679$8A552FD3-96C7-44E9-A550-DB0F897FC5FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dfe7538a34ee9e7b843bc0d9d5ef655a3964d6bd","datavalue":{"value":{"entity-type":"item","numeric-id":1886199,"id":"Q1886199"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9d91b0a6f672c518bb744e971910b8a9e05f40ab","datavalue":{"value":{"amount":"+0.7135900259017944","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q916679$D9DF3191-1330-4B49-9815-12239E69767F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm to find all paths between two nodes in a graph","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_to_find_all_paths_between_two_nodes_in_a_graph"}}}}}