Title: GitHub - Matth-L/Maximum-Flow-Problem: Finding the Shortest Path Using the Dinic Algorithm
Open Graph Title: GitHub - Matth-L/Maximum-Flow-Problem: Finding the Shortest Path Using the Dinic Algorithm
X Title: GitHub - Matth-L/Maximum-Flow-Problem: Finding the Shortest Path Using the Dinic Algorithm
Description: Finding the Shortest Path Using the Dinic Algorithm - Matth-L/Maximum-Flow-Problem
Open Graph Description: Finding the Shortest Path Using the Dinic Algorithm - Matth-L/Maximum-Flow-Problem
X Description: Finding the Shortest Path Using the Dinic Algorithm - Matth-L/Maximum-Flow-Problem
Opengraph URL: https://github.com/Matth-L/Maximum-Flow-Problem
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /:user_id/:repository |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:7efffecf-7704-948f-51e3-e7f438ea3582 |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | DFFA:D5FCA:C8A0BE:10E9EDE:698E435D |
| html-safe-nonce | ec54b3bef2a6c1823a278c9ee97bd0d179c628dfcb92bd560960cc62ba90e04e |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJERkZBOkQ1RkNBOkM4QTBCRToxMEU5RURFOjY5OEU0MzVEIiwidmlzaXRvcl9pZCI6IjU3Mzc3MjQ3NDAzODM5NDk2NjEiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 9c3e887a44db5375912b3df2c0c1c4c420f01f2af32b6e61e0e4ab376eae6989 |
| hovercard-subject-tag | repository:722602702 |
| github-keyboard-shortcuts | repository,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/Matth-L/Maximum-Flow-Problem |
| twitter:image | https://opengraph.githubassets.com/2d4e648df972ca68c8b7036288f9fdcf00bc4de72676af1ce67f73361a984229/Matth-L/Maximum-Flow-Problem |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/2d4e648df972ca68c8b7036288f9fdcf00bc4de72676af1ce67f73361a984229/Matth-L/Maximum-Flow-Problem |
| og:image:alt | Finding the Shortest Path Using the Dinic Algorithm - Matth-L/Maximum-Flow-Problem |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | a5632af64f7fed7bff1d6a428d1aca1b94fa7a48f760de2d39d9b1effdbf0082 |
| turbo-cache-control | no-preview |
| go-import | github.com/Matth-L/Maximum-Flow-Problem git https://github.com/Matth-L/Maximum-Flow-Problem.git |
| octolytics-dimension-user_id | 71249405 |
| octolytics-dimension-user_login | Matth-L |
| octolytics-dimension-repository_id | 722602702 |
| octolytics-dimension-repository_nwo | Matth-L/Maximum-Flow-Problem |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 722602702 |
| octolytics-dimension-repository_network_root_nwo | Matth-L/Maximum-Flow-Problem |
| 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 | 3dda52e29a416820ced574e74040033b820613a2 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width