Title: Enforce the consistency between function parameters and algorithm input · Issue #33 · algorithm-visualizer/algorithms · GitHub
Open Graph Title: Enforce the consistency between function parameters and algorithm input · Issue #33 · algorithm-visualizer/algorithms
X Title: Enforce the consistency between function parameters and algorithm input · Issue #33 · algorithm-visualizer/algorithms
Description: Take Breadth-First Search/tree.js (shown below) as an example. The input to the BFS algorithm is a graph (or tree) and a starting node, while the BFS function only takes the starting node s as parameter, leaving the graph G as a global v...
Open Graph Description: Take Breadth-First Search/tree.js (shown below) as an example. The input to the BFS algorithm is a graph (or tree) and a starting node, while the BFS function only takes the starting node s as para...
X Description: Take Breadth-First Search/tree.js (shown below) as an example. The input to the BFS algorithm is a graph (or tree) and a starting node, while the BFS function only takes the starting node s as para...
Opengraph URL: https://github.com/algorithm-visualizer/algorithms/issues/33
X: @github
Domain: Github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Enforce the consistency between function parameters and algorithm input","articleBody":"Take Breadth-First Search/tree.js (shown below) as an example. \r\n\r\nThe input to the BFS algorithm is a graph (or tree) and a starting node, while the `BFS` function only takes the starting node `s` as parameter, leaving the graph `G` as a global variable. In my humble opinion, it would be better to avoid such mismatch, which can potentially confuse learners. \r\n\r\nNote: This mismatch also appears in some other algorithm code.\r\n\r\nhttps://github.com/algorithm-visualizer/algorithms/blob/fe3adcf890da652e5cda842d7f90b50fa7242e3a/Brute%20Force/Breadth-First%20Search/tree.js#L1-L50","author":{"url":"https://github.com/unfode","@type":"Person","name":"unfode"},"datePublished":"2022-04-13T06:47:21.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/33/algorithms/issues/33"}| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:c608383c-f8bf-7386-96f0-5a867572627c |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | CEC0:2F56D9:12C2B:19B61:6A626560 |
| html-safe-nonce | b39f1764644357ffc7f015b45a1b8c4f80a809aeaf770f6f421c8018125dd9f5 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDRUMwOjJGNTZEOToxMkMyQjoxOUI2MTo2QTYyNjU2MCIsInZpc2l0b3JfaWQiOiI4ODAyNTE3ODYxMjc1OTUyNDgwIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= |
| visitor-hmac | c7c9602450f2b179419844374f8782124ad2c36fc5ca0719d61352b254a738a9 |
| hovercard-subject-tag | issue:1202836101 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/algorithm-visualizer/algorithms/33/issue_layout |
| twitter:image | https://opengraph.githubassets.com/026ab339fc01cbe7fefec9806c562e71608d1faa73d4b4b3312c5da1632a185b/algorithm-visualizer/algorithms/issues/33 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/026ab339fc01cbe7fefec9806c562e71608d1faa73d4b4b3312c5da1632a185b/algorithm-visualizer/algorithms/issues/33 |
| og:image:alt | Take Breadth-First Search/tree.js (shown below) as an example. The input to the BFS algorithm is a graph (or tree) and a starting node, while the BFS function only takes the starting node s as para... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | unfode |
| hostname | github.com |
| expected-hostname | github.com |
| None | 194bddaed53c0eb07047629c520853f4208e77a17ff57428346485cc202e39f2 |
| turbo-cache-control | no-preview |
| go-import | github.com/algorithm-visualizer/algorithms git https://github.com/algorithm-visualizer/algorithms.git |
| octolytics-dimension-user_id | 38487505 |
| octolytics-dimension-user_login | algorithm-visualizer |
| octolytics-dimension-repository_id | 131671107 |
| octolytics-dimension-repository_nwo | algorithm-visualizer/algorithms |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 131671107 |
| octolytics-dimension-repository_network_root_nwo | algorithm-visualizer/algorithms |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | c2862cf2db52f0c7f6cba3de21ffeeafe7c5456e |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width