Title: Issues · 1cucer/minimum-cut · GitHub
Open Graph Title: Issues · 1cucer/minimum-cut
X Title: Issues · 1cucer/minimum-cut
Description: The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into two disjoint sets of vertices. The solution to this problem has important applications in various fields, such as network design, image processing, etc. - Issues · 1cucer/minimum-cut
Open Graph Description: The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into t...
X Description: The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into t...
Opengraph URL: https://github.com/1cucer/minimum-cut
X: @github
Domain: github.com
| route-pattern | /:user_id/:repository/issues(.:format) |
| route-controller | issues |
| route-action | index |
| fetch-nonce | v2:4db5fa77-2abd-cbd0-1db2-ba8560781538 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | 92C4:14BF46:3426BCE:4521FE8:6A65460C |
| html-safe-nonce | a9aac4f561ddf9fac7e2f645df5c9d484808d09300b2fe99661b2b6bb97b8ce6 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5MkM0OjE0QkY0NjozNDI2QkNFOjQ1MjFGRTg6NkE2NTQ2MEMiLCJ2aXNpdG9yX2lkIjoiNTg1MDQwMTU3OTYxNTk5NTQwNCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 0bf01bb966e6845aa4c45e908edd65923cf49736e777ec0ece7ddd3d564c6227 |
| hovercard-subject-tag | repository:598116393 |
| 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/1cucer/minimum-cut/issues |
| twitter:image | https://opengraph.githubassets.com/62fc06d98a8e36be8c399b072f1e7dbf35b3b87a7f758bd1f3830042f14d9d2c/1cucer/minimum-cut |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/62fc06d98a8e36be8c399b072f1e7dbf35b3b87a7f758bd1f3830042f14d9d2c/1cucer/minimum-cut |
| og:image:alt | The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into t... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 52c76df668885aaff23b50bdca1fa1ea44ac9c1553e888ebc70ff1e4daa4625b |
| turbo-cache-control | no-cache |
| go-import | github.com/1cucer/minimum-cut git https://github.com/1cucer/minimum-cut.git |
| octolytics-dimension-user_id | 86965240 |
| octolytics-dimension-user_login | 1cucer |
| octolytics-dimension-repository_id | 598116393 |
| octolytics-dimension-repository_nwo | 1cucer/minimum-cut |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 598116393 |
| octolytics-dimension-repository_network_root_nwo | 1cucer/minimum-cut |
| 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 | 309153364422b3c499922d1a2a6404910a58ed8e |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width