{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":816038480,"defaultBranch":"main","name":"Emergency-Travel-Plan-using-Adjacency-Lists-and-BFS-DFS-Algorithms","ownerLogin":"areeba0","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-06-16T22:17:09.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/136759791?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1718576229.0","currentOid":""},"activityList":{"items":[{"before":"73f7b0b606c91f93b844f3cd8d82f17cabcf0baa","after":"a51d9497ad44ef94bbd8ed7ffdc4add624350a22","ref":"refs/heads/main","pushedAt":"2024-06-16T22:29:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"areeba0","name":null,"path":"/areeba0","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/136759791?s=80&v=4"},"commit":{"message":"Add files via upload\n\n\r\nThis C++ project implements an Emergency Travel Planning System using graph theory's adjacency lists, employing BFS and DFS for efficient city navigation. It optimizes routes based on user preferences for minimizing travel time or cost, with dynamic memory management for city and route data","shortMessageHtmlLink":"Add files via upload"}},{"before":"47f2fae990291e81ef7d529f00d31f67fffcd609","after":"73f7b0b606c91f93b844f3cd8d82f17cabcf0baa","ref":"refs/heads/main","pushedAt":"2024-06-16T22:28:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"areeba0","name":null,"path":"/areeba0","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/136759791?s=80&v=4"},"commit":{"message":"Update README.md\n\n\r\nThis C++ project implements an Emergency Travel Planning System using graph theory's adjacency lists, employing BFS and DFS for efficient city navigation. It optimizes routes based on user preferences for minimizing travel time or cost, with dynamic memory management for city and route data.","shortMessageHtmlLink":"Update README.md"}},{"before":"3033a06ee251f97227d4bb1b58e9f3484a8dd2e0","after":"47f2fae990291e81ef7d529f00d31f67fffcd609","ref":"refs/heads/main","pushedAt":"2024-06-16T22:23:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"areeba0","name":null,"path":"/areeba0","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/136759791?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":null,"after":"3033a06ee251f97227d4bb1b58e9f3484a8dd2e0","ref":"refs/heads/main","pushedAt":"2024-06-16T22:17:09.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"areeba0","name":null,"path":"/areeba0","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/136759791?s=80&v=4"},"commit":{"message":"Initial commit","shortMessageHtmlLink":"Initial commit"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEZtZIbAA","startCursor":null,"endCursor":null}},"title":"Activity · areeba0/Emergency-Travel-Plan-using-Adjacency-Lists-and-BFS-DFS-Algorithms"}