{"id":28960,"date":"2023-01-04T15:25:05","date_gmt":"2023-01-04T09:55:05","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/"},"modified":"2023-01-04T15:25:05","modified_gmt":"2023-01-04T09:55:05","slug":"solved-2-d-array-friends-of-friends-list","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/","title":{"rendered":"[Solved] 2-D array Friends of Friends List"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-50584445\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"50584445\" data-parentid=\"50583359\" data-score=\"1\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>Why not try something like this. Of course, i have taken a bit of freedom on the design as you didnt provide any code. Hope this helps!<\/p>\n<pre><code>private static Set&lt;Node&gt; getNodesFollowAllEdges(Node node) {\n    Set&lt;Node&gt; nodes = getNodesFollowAllEdges(node, new HashSet&lt;&gt;());\n    \/\/ remember to remove the original node from the set\n    nodes.remove(node);\n    return nodes;\n}\n\nprivate static Set&lt;Node&gt; getNodesFollowAllEdges(Node node, Set&lt;Node&gt; visited) {\n    if (node.getConnectedNodes().isEmpty()) {\n        return visited;\n    }\n\n    for (Node n : node.getConnectedNodes()) {\n        if (!visited.contains(n)) {\n            visited.add(n);\n            getNodesFollowAllEdges(n, visited);\n        }\n    }\n    return visited;\n}\n<\/code><\/pre>\n<p>Also, it is very easy to provide a maximum search dept. Just add <code>int maxDept<\/code> and increase it every recursion step.<\/p>\n<p>Given the following example:<\/p>\n<pre><code>Node a = new Node(\"A\");\nNode b = new Node(\"B\");\nNode c = new Node(\"C\");\nNode d = new Node(\"D\");\nNode e = new Node(\"E\");\nNode f = new Node(\"F\");\nNode g = new Node(\"G\");\n\na.addConnectedNodes(b, c, d);\nb.addConnectedNodes(e, f);\nc.addConnectedNodes(a);\ne.addConnectedNodes(b);\nf.addConnectedNodes(b);\ng.addConnectedNodes(f);\n\nSet&lt;Node&gt; friends = getNodesFollowAllEdges(a);\nfriends.forEach(node -&gt; System.out.println(node.getName()));\n<\/code><\/pre>\n<p>should give you the correct result of (order neglected)<\/p>\n<pre><code>B\nF\nE\n<\/code><\/pre>\n<p>Note: Remember that, since its a <code>Set<\/code>, the resulting nodes can be in any order.<\/p>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\"><\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved 2-D array Friends of Friends List <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] Why not try something like this. Of course, i have taken a bit of freedom on the design as you didnt provide any code. Hope this helps! private static Set&lt;Node&gt; getNodesFollowAllEdges(Node node) { Set&lt;Node&gt; nodes = getNodesFollowAllEdges(node, new HashSet&lt;&gt;()); \/\/ remember to remove the original node from the set nodes.remove(node); return nodes; } private &#8230; <a title=\"[Solved] 2-D array Friends of Friends List\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\" aria-label=\"More on [Solved] 2-D array Friends of Friends List\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[323],"class_list":["post-28960","post","type-post","status-publish","format-standard","hentry","category-solved","tag-java"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] 2-D array Friends of Friends List - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] 2-D array Friends of Friends List - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] Why not try something like this. Of course, i have taken a bit of freedom on the design as you didnt provide any code. Hope this helps! private static Set&lt;Node&gt; getNodesFollowAllEdges(Node node) { Set&lt;Node&gt; nodes = getNodesFollowAllEdges(node, new HashSet&lt;&gt;()); \/\/ remember to remove the original node from the set nodes.remove(node); return nodes; } private ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-01-04T09:55:05+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] 2-D array Friends of Friends List\",\"datePublished\":\"2023-01-04T09:55:05+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\"},\"wordCount\":89,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"java\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\",\"name\":\"[Solved] 2-D array Friends of Friends List - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2023-01-04T09:55:05+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] 2-D array Friends of Friends List\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] 2-D array Friends of Friends List - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] 2-D array Friends of Friends List - JassWeb","og_description":"[ad_1] Why not try something like this. Of course, i have taken a bit of freedom on the design as you didnt provide any code. Hope this helps! private static Set&lt;Node&gt; getNodesFollowAllEdges(Node node) { Set&lt;Node&gt; nodes = getNodesFollowAllEdges(node, new HashSet&lt;&gt;()); \/\/ remember to remove the original node from the set nodes.remove(node); return nodes; } private ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/","og_site_name":"JassWeb","article_published_time":"2023-01-04T09:55:05+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] 2-D array Friends of Friends List","datePublished":"2023-01-04T09:55:05+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/"},"wordCount":89,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["java"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/","url":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/","name":"[Solved] 2-D array Friends of Friends List - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-01-04T09:55:05+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-2-d-array-friends-of-friends-list\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] 2-D array Friends of Friends List"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28960","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=28960"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/28960\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=28960"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=28960"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=28960"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}