{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"ProjetAlgo","owner":"AlgoAvanc","isFork":false,"description":"The purpose of the project is to calculate the diameter (the longest of the shortest paths) of the Parisian subway graph","allTopics":["java","graph-algorithms","json-parser","dijsktra-shortest-path","bfs-algorithm"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-06-07T08:41:13.661Z"}}],"repositoryCount":1,"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":"AlgoAvanc repositories"}