Title: Commits · JunyiJ/Fault-Tree-Python · GitHub
Open Graph Title: Commits · JunyiJ/Fault-Tree-Python
X Title: Commits · JunyiJ/Fault-Tree-Python
Description: Using Monte Carlo method to find a minimal cut set (MCS) for a fault tree. - Commits · JunyiJ/Fault-Tree-Python
Open Graph Description: Using Monte Carlo method to find a minimal cut set (MCS) for a fault tree. - Commits · JunyiJ/Fault-Tree-Python
X Description: Using Monte Carlo method to find a minimal cut set (MCS) for a fault tree. - Commits · JunyiJ/Fault-Tree-Python
Opengraph URL: https://github.com/JunyiJ/Fault-Tree-Python
X: @github
Domain: github.com
| route-pattern | /:user_id/:repository/graphs/commit-activity(.:format) |
| route-controller | repos_insights_commit_activity |
| route-action | index |
| fetch-nonce | v2:1ccbe66b-8ff8-e20b-9c85-e67f57e9a9cd |
| current-catalog-service-hash | b4d8436665c5448282b6f4eacc6394e6e8801de97cb226acdca9da20ae59be92 |
| request-id | B98E:D45ED:438999:615F56:6A61CB6B |
| html-safe-nonce | 091142bc1b39e3d5b2da492adf404f90915c6310857a5bb520e972b735def248 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCOThFOkQ0NUVEOjQzODk5OTo2MTVGNTY6NkE2MUNCNkIiLCJ2aXNpdG9yX2lkIjoiNDk4MTIwMTI5NzAyMzgyNDQzIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= |
| visitor-hmac | a9451139317b46d76881c7f6a0e04e6fdbf7483008c71562e8c2028c5e8178b3 |
| hovercard-subject-tag | repository:62855090 |
| 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/JunyiJ/Fault-Tree-Python/graphs/commit-activity |
| twitter:image | https://opengraph.githubassets.com/1d9176ae57587e948752f95661dfb7083f33b09eeef10b8fcf4a894d153a1084/JunyiJ/Fault-Tree-Python |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/1d9176ae57587e948752f95661dfb7083f33b09eeef10b8fcf4a894d153a1084/JunyiJ/Fault-Tree-Python |
| og:image:alt | Using Monte Carlo method to find a minimal cut set (MCS) for a fault tree. - Commits · JunyiJ/Fault-Tree-Python |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | b2de8c74e5e61e893155ba46ee41bc66170c1644cb795adefa8386d490f7781c |
| turbo-cache-control | no-cache |
| go-import | github.com/JunyiJ/Fault-Tree-Python git https://github.com/JunyiJ/Fault-Tree-Python.git |
| octolytics-dimension-user_id | 8421173 |
| octolytics-dimension-user_login | JunyiJ |
| octolytics-dimension-repository_id | 62855090 |
| octolytics-dimension-repository_nwo | JunyiJ/Fault-Tree-Python |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 62855090 |
| octolytics-dimension-repository_network_root_nwo | JunyiJ/Fault-Tree-Python |
| 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 | d1866027ded575df8a15c731dd8b9986c9483ceb |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width