Title: Pull requests · SleekPanther/reverse-delete-algorithm · GitHub
Open Graph Title: Pull requests · SleekPanther/reverse-delete-algorithm
X Title: Pull requests · SleekPanther/reverse-delete-algorithm
Description: Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph - Pull requests · SleekPanther/reverse-delete-algorithm
Open Graph Description: Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph - Pull requests · SleekPanther/reverse-delete-algorithm
X Description: Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph - Pull requests · SleekPanther/reverse-delete-algorithm
Opengraph URL: https://github.com/SleekPanther/reverse-delete-algorithm
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /:user_id/:repository/pulls(.:format) |
| route-controller | pull_requests |
| route-action | index |
| fetch-nonce | v2:9bc812ad-ad32-e133-dbaf-a716e14e8a0a |
| current-catalog-service-hash | ae870bc5e265a340912cde392f23dad3671a0a881730ffdadd82f2f57d81641b |
| request-id | D2F8:C2770:27A00D7:35DFA7D:698C704E |
| html-safe-nonce | ff1be62c54fcbce139cbe73900812e9170e4b5ea025397943ecf4d00d04cd6f9 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEMkY4OkMyNzcwOjI3QTAwRDc6MzVERkE3RDo2OThDNzA0RSIsInZpc2l0b3JfaWQiOiIxMDY3ODY0NDM2NjYxNTc2NDYiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | f7fe8eba1bcb4655339b4136012ee65cd55d09168fc4f3db6dc42bfb028a604d |
| hovercard-subject-tag | repository:99710334 |
| github-keyboard-shortcuts | repository,pull-request-list,pull-request-conversation,pull-request-files-changed,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location-query-strip | true |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/SleekPanther/reverse-delete-algorithm/pulls |
| twitter:image | https://opengraph.githubassets.com/6af7e4baa4dbacd9be1c2a98d47c6ab76c51a3fae4f0527633e1a166c0940aa6/SleekPanther/reverse-delete-algorithm |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/6af7e4baa4dbacd9be1c2a98d47c6ab76c51a3fae4f0527633e1a166c0940aa6/SleekPanther/reverse-delete-algorithm |
| og:image:alt | Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph - Pull requests · SleekPanther/reverse-delete-algorithm |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 640eeb7b6ff4d8d106235d228c0c286e82592d4d2403227b5b2b4fc5832297a4 |
| turbo-cache-control | no-preview |
| go-import | github.com/SleekPanther/reverse-delete-algorithm git https://github.com/SleekPanther/reverse-delete-algorithm.git |
| octolytics-dimension-user_id | 15304528 |
| octolytics-dimension-user_login | SleekPanther |
| octolytics-dimension-repository_id | 99710334 |
| octolytics-dimension-repository_nwo | SleekPanther/reverse-delete-algorithm |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 99710334 |
| octolytics-dimension-repository_network_root_nwo | SleekPanther/reverse-delete-algorithm |
| 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 | 3d444f0a47beeeac94cddbb51c91ab408befe8d4 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width