{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"VieCut","owner":"VieCut","isFork":false,"description":"VieCut 1.00 - Shared-memory Minimum Cuts","allTopics":["mincut","graph-cut","minimum-cut","algorithm","algorithms","graph","graphs","parallel","cut","efficient-algorithm","minimum-cut-algorithm","multiterminal-cuts"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":42,"forksCount":10,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-19T13:38:58.346Z"}},{"type":"Public","name":"viecut.github.io","owner":"VieCut","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-06-12T06:51:11.279Z"}}],"repositoryCount":2,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"VieCut repositories"}