{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-05-26T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":54810,"title":"Length of shortest path in a directed graph. ","description":"Given a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 42px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 21px; transform-origin: 407px 21px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381px 8px; transform-origin: 381px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eGiven a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = shortest_path_length(G,a,b)\r\n  y = 5;\r\nend","test_suite":"%%\r\ns = [1 1 2 3 3 4 4 6 6 7 8 7 5];\r\nt = [2 3 4 4 5 5 6 1 8 1 3 2 8];\r\nG = digraph(s,t);\r\nassert(isequal(shortest_path_length(G,7,8),4))\r\n\r\n%%\r\nA = ones(4) - diag([1 1 1 1]);\r\nG = digraph(A~=0);\r\nassert(isequal(shortest_path_length(G,1,3),1))\r\n\r\n%%\r\ns = [1 1 1 2 2 3 3 4 5 5 6 7];\r\nt = [2 4 8 3 7 4 6 5 6 8 7 8];\r\nG = digraph(s,t);\r\nassert(isequal(shortest_path_length(G,2,4),2))\r\n\r\n%%\r\nA = [0 1 0 1 0 1 0 0\r\n  0 0 0 1 1 0 1 1\r\n  1 1 0 1 1 0 1 1\r\n  0 1 0 0 1 0 1 0\r\n  1 1 0 0 1 0 1 0\r\n  1 0 0 0 0 0 1 0\r\n  1 1 1 1 0 0 0 1\r\n  0 0 0 1 1 1 1 1];\r\nG=digraph(A);\r\nassert(isequal(shortest_path_length(G,2,6),2))\r\n\r\n%%\r\nA = [0 1 0 1 0 1 0 0\r\n  0 0 0 1 1 0 1 1\r\n  1 1 0 1 1 0 1 1\r\n  0 1 0 0 1 0 1 0\r\n  1 1 0 0 1 0 1 0\r\n  1 0 0 0 0 0 1 0\r\n  1 1 1 1 0 0 0 1\r\n  0 0 0 1 1 1 1 1];\r\nG=digraph(A);\r\nassert(isequal(shortest_path_length(G,5,1),1))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":2438685,"edited_by":223089,"edited_at":"2022-08-03T11:04:27.000Z","deleted_by":null,"deleted_at":null,"solvers_count":13,"test_suite_updated_at":"2022-08-03T11:04:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2022-07-12T09:34:37.000Z","updated_at":"2026-04-14T11:01:24.000Z","published_at":"2022-07-12T09:34:37.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"problems":[{"id":54810,"title":"Length of shortest path in a directed graph. ","description":"Given a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. ","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 42px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 21px; transform-origin: 407px 21px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381px 8px; transform-origin: 381px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eGiven a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. \u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = shortest_path_length(G,a,b)\r\n  y = 5;\r\nend","test_suite":"%%\r\ns = [1 1 2 3 3 4 4 6 6 7 8 7 5];\r\nt = [2 3 4 4 5 5 6 1 8 1 3 2 8];\r\nG = digraph(s,t);\r\nassert(isequal(shortest_path_length(G,7,8),4))\r\n\r\n%%\r\nA = ones(4) - diag([1 1 1 1]);\r\nG = digraph(A~=0);\r\nassert(isequal(shortest_path_length(G,1,3),1))\r\n\r\n%%\r\ns = [1 1 1 2 2 3 3 4 5 5 6 7];\r\nt = [2 4 8 3 7 4 6 5 6 8 7 8];\r\nG = digraph(s,t);\r\nassert(isequal(shortest_path_length(G,2,4),2))\r\n\r\n%%\r\nA = [0 1 0 1 0 1 0 0\r\n  0 0 0 1 1 0 1 1\r\n  1 1 0 1 1 0 1 1\r\n  0 1 0 0 1 0 1 0\r\n  1 1 0 0 1 0 1 0\r\n  1 0 0 0 0 0 1 0\r\n  1 1 1 1 0 0 0 1\r\n  0 0 0 1 1 1 1 1];\r\nG=digraph(A);\r\nassert(isequal(shortest_path_length(G,2,6),2))\r\n\r\n%%\r\nA = [0 1 0 1 0 1 0 0\r\n  0 0 0 1 1 0 1 1\r\n  1 1 0 1 1 0 1 1\r\n  0 1 0 0 1 0 1 0\r\n  1 1 0 0 1 0 1 0\r\n  1 0 0 0 0 0 1 0\r\n  1 1 1 1 0 0 0 1\r\n  0 0 0 1 1 1 1 1];\r\nG=digraph(A);\r\nassert(isequal(shortest_path_length(G,5,1),1))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":2438685,"edited_by":223089,"edited_at":"2022-08-03T11:04:27.000Z","deleted_by":null,"deleted_at":null,"solvers_count":13,"test_suite_updated_at":"2022-08-03T11:04:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2022-07-12T09:34:37.000Z","updated_at":"2026-04-14T11:01:24.000Z","published_at":"2022-07-12T09:34:37.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node. \u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"errors":[],"facets":[[],[{"value":"easy","count":1,"selected":false}]],"term":"tag:\"digraphs\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}