{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"DataStructures","owner":"AlgorithmsCourse","isFork":false,"description":"Bag Data Structure for Graphs","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-25T20:44:35.999Z"}},{"type":"Public","name":"DiGraphs","owner":"AlgorithmsCourse","isFork":false,"description":"Digraph set up and processing algorithms","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-09T16:17:54.435Z"}},{"type":"Public","name":"Graph-Processing-Algs","owner":"AlgorithmsCourse","isFork":false,"description":"Code and test client for Prim's, Dijkstra's minimum spanning tree algs","allTopics":["priority-queue","topological-sort","minimum-spanning-trees","dfs-algorithm","prim-algorithm","dijkstra-shortest-path","index-priority-queue"],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-07T01:19:45.249Z"}},{"type":"Public","name":"GraphDataTypes","owner":"AlgorithmsCourse","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-06T21:05:00.685Z"}},{"type":"Public","name":"PriorityQueue","owner":"AlgorithmsCourse","isFork":false,"description":"Implement IndexPQ","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-06T20:41:08.421Z"}},{"type":"Public","name":"BreadthFirstSearch","owner":"AlgorithmsCourse","isFork":false,"description":"Creates Graph data type and processes using Breadth First Search","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-06-21T20:31:42.580Z"}},{"type":"Public","name":"UnionFind","owner":"AlgorithmsCourse","isFork":false,"description":"Implementation of UnionFind in C# with test client.","allTopics":["algorithm","csharp","union-find","quick-union","quick-find"],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-02-13T05:32:12.221Z"}},{"type":"Public","name":"Queues","owner":"AlgorithmsCourse","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-02-11T09:09:41.888Z"}},{"type":"Public","name":"Stacks","owner":"AlgorithmsCourse","isFork":false,"description":"C# implementation of Stacks and exercises that use them","allTopics":[],"primaryLanguage":{"name":"C#","color":"#178600"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-02-10T04:43:46.168Z"}}],"repositoryCount":9,"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":"AlgorithmsCourse repositories"}