{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":714206626,"defaultBranch":"main","name":"Data-Structures-and-Algorithms","ownerLogin":"AtharvaKulkarniIT","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-11-04T08:12:43.000Z","ownerAvatar":"https://github.com/avatars/u/122991006?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1701089784.0","currentOid":""},"activityList":{"items":[{"before":"c457a3fd30f73ff3361717d6d93a3fd849e9f5e3","after":"cb8c548603a4f1f594e8f5b769cff07a03b4c3cd","ref":"refs/heads/main","pushedAt":"2023-12-02T02:28:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update PrimList.c","shortMessageHtmlLink":"Update PrimList.c"}},{"before":"e970a235589484d82c774ec87a685d761034ba40","after":"c457a3fd30f73ff3361717d6d93a3fd849e9f5e3","ref":"refs/heads/main","pushedAt":"2023-12-02T02:27:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Create KruskalList.c","shortMessageHtmlLink":"Create KruskalList.c"}},{"before":"743c00dc285d19931e7995ab45a00ad14c6f996a","after":"e970a235589484d82c774ec87a685d761034ba40","ref":"refs/heads/main","pushedAt":"2023-12-02T02:13:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Create PrimList.cpp","shortMessageHtmlLink":"Create PrimList.cpp"}},{"before":"fe95c33ce2d0772aab5ff1994f93b589b346b3d0","after":"743c00dc285d19931e7995ab45a00ad14c6f996a","ref":"refs/heads/main","pushedAt":"2023-11-27T12:59:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"added Hashtable\n\nA hashtable with chaining is a data structure that resolves collisions by maintaining a linked list at each hash table entry. When multiple keys hash to the same index, they are stored as nodes in a linked list, allowing for efficient handling of collisions. This approach ensures constant time average-case complexity for key insertion, retrieval, and deletion, making it a widely-used technique for implementing associative arrays and symbol tables in computer science.","shortMessageHtmlLink":"added Hashtable"}},{"before":"f2d6e33052c70b0211d73fffdfe0b3048f76a88a","after":"fe95c33ce2d0772aab5ff1994f93b589b346b3d0","ref":"refs/heads/main","pushedAt":"2023-11-27T12:57:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"added new file","shortMessageHtmlLink":"added new file"}},{"before":"66036355f98312f07c485a84235b7c377337ccdd","after":"f2d6e33052c70b0211d73fffdfe0b3048f76a88a","ref":"refs/heads/main","pushedAt":"2023-11-27T12:56:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"added","shortMessageHtmlLink":"added"}},{"before":"971f3444ba1fafd0342c6f0c209f8f8e94f546d3","after":"66036355f98312f07c485a84235b7c377337ccdd","ref":"refs/heads/main","pushedAt":"2023-11-27T12:56:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Add files via upload","shortMessageHtmlLink":"Add files via upload"}},{"before":"16fefd8637b7256bfcbeb6cc12f6e5897ab5ce5c","after":"971f3444ba1fafd0342c6f0c209f8f8e94f546d3","ref":"refs/heads/main","pushedAt":"2023-11-27T12:50:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"53974a065d15cf94e2bb31f0c287025c580be831","after":"16fefd8637b7256bfcbeb6cc12f6e5897ab5ce5c","ref":"refs/heads/main","pushedAt":"2023-11-25T19:02:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"75c207379f46ec49f9a27ef45e23baeff330b320","after":"53974a065d15cf94e2bb31f0c287025c580be831","ref":"refs/heads/main","pushedAt":"2023-11-25T19:01:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"4201bce88a10f6e72fc90f6229794453042ef24a","after":"75c207379f46ec49f9a27ef45e23baeff330b320","ref":"refs/heads/main","pushedAt":"2023-11-25T18:04:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Added Queue","shortMessageHtmlLink":"Added Queue"}},{"before":"855e3fb730e570e9722a472eeec06a234cb78733","after":"4201bce88a10f6e72fc90f6229794453042ef24a","ref":"refs/heads/main","pushedAt":"2023-11-17T10:48:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"01875c24efb01101e8b3083bdda3cdaa38683a71","after":"855e3fb730e570e9722a472eeec06a234cb78733","ref":"refs/heads/main","pushedAt":"2023-11-17T10:46:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"ff2f1e803320bc3cede8430c16af7b1ea96ae22a","after":"01875c24efb01101e8b3083bdda3cdaa38683a71","ref":"refs/heads/main","pushedAt":"2023-11-17T10:45:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"e43211a69397106095a0846dccc9409d78b3886d","after":"ff2f1e803320bc3cede8430c16af7b1ea96ae22a","ref":"refs/heads/main","pushedAt":"2023-11-17T10:39:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update Binary Tree.","shortMessageHtmlLink":"Update Binary Tree."}},{"before":"e0e4f63dc3b151590dab775ce62a8ffec35f1903","after":"e43211a69397106095a0846dccc9409d78b3886d","ref":"refs/heads/main","pushedAt":"2023-11-17T10:35:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Added Binary Search Tree","shortMessageHtmlLink":"Added Binary Search Tree"}},{"before":"5bb785d9e38395131887b4de7fd75fd034049986","after":"e0e4f63dc3b151590dab775ce62a8ffec35f1903","ref":"refs/heads/main","pushedAt":"2023-11-16T11:07:01.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Merge pull request #3 from CodeAlchemyX/patch-2\n\nAdded AVL tree","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1996609654\" data-permission-text=\"Title is private\" data-url=\"https://github.com/AtharvaKulkarniIT/Data-Structures-and-Algorithms/issues/3\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/AtharvaKulkarniIT/Data-Structures-and-Algorithms/pull/3/hovercard\" href=\"https://github.com/AtharvaKulkarniIT/Data-Structures-and-Algorithms/pull/3\">#3</a> from CodeAlchemyX/patch-2"}},{"before":"fb6dff247548391cb7de548515553d13876edf1b","after":"5bb785d9e38395131887b4de7fd75fd034049986","ref":"refs/heads/main","pushedAt":"2023-11-16T10:45:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update BinaryTree.c","shortMessageHtmlLink":"Update BinaryTree.c"}},{"before":"f65032e5670087c0a6d631cabffaf2d3c23e7c90","after":"fb6dff247548391cb7de548515553d13876edf1b","ref":"refs/heads/main","pushedAt":"2023-11-16T06:00:57.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Merge pull request #2 from CodeAlchemyX/patch-1\n\nAdded BinaryTree","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1996123779\" data-permission-text=\"Title is private\" data-url=\"https://github.com/AtharvaKulkarniIT/Data-Structures-and-Algorithms/issues/2\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/AtharvaKulkarniIT/Data-Structures-and-Algorithms/pull/2/hovercard\" href=\"https://github.com/AtharvaKulkarniIT/Data-Structures-and-Algorithms/pull/2\">#2</a> from CodeAlchemyX/patch-1"}},{"before":"d4c5bc2652df37f0ccc030d1ae3e684364ab77cc","after":"f65032e5670087c0a6d631cabffaf2d3c23e7c90","ref":"refs/heads/main","pushedAt":"2023-11-08T09:14:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Added Kruskal.c","shortMessageHtmlLink":"Added Kruskal.c"}},{"before":"5daf5232c59eef162de08476745b052b55e2caaa","after":"d4c5bc2652df37f0ccc030d1ae3e684364ab77cc","ref":"refs/heads/main","pushedAt":"2023-11-08T08:56:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Added Kruskal.c\n\nKruskal's algorithm is a greedy algorithm for constructing a Minimum Spanning Tree (MST). \r\n\r\nInitialization:\r\n\r\nBegin with an empty set of edges.\r\nSort all the edges in the graph by their weights in non-decreasing order.\r\nAdding Edges:\r\n\r\nStarting with the edge of the smallest weight, add edges to the MST one by one.\r\nEnsure that adding an edge does not create a cycle in the MST. If adding an edge creates a cycle, skip it.\r\nTermination:\r\n\r\nContinue adding edges until the MST contains (V-1) edges, where V is the number of nodes in the graph.","shortMessageHtmlLink":"Added Kruskal.c"}},{"before":"d96ef32f4bf430c80d3a18e319b0a9b6ea50a679","after":"5daf5232c59eef162de08476745b052b55e2caaa","ref":"refs/heads/main","pushedAt":"2023-11-08T08:54:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update Kruskal.c","shortMessageHtmlLink":"Update Kruskal.c"}},{"before":"a49e2255c7cfdfb3a763848be460f22bd9453f9d","after":"d96ef32f4bf430c80d3a18e319b0a9b6ea50a679","ref":"refs/heads/main","pushedAt":"2023-11-08T06:43:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update Prim.c","shortMessageHtmlLink":"Update Prim.c"}},{"before":"6a226166e54b1bf910776bf3550e22cbca7f33f1","after":"a49e2255c7cfdfb3a763848be460f22bd9453f9d","ref":"refs/heads/main","pushedAt":"2023-11-08T06:37:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"fe43669ca7a896c7db8176c3dd056f23dc617b55","after":"6a226166e54b1bf910776bf3550e22cbca7f33f1","ref":"refs/heads/main","pushedAt":"2023-11-08T06:17:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Added Kruskal.c\n\nKruskal's algorithm is a greedy algorithm for constructing a Minimum Spanning Tree (MST). Unlike Prim's algorithm, which starts with a single node and grows the tree gradually, Kruskal's algorithm takes a different approach.\r\n\r\nInitialization:\r\n\r\nBegin with an empty set of edges.\r\nSort all the edges in the graph by their weights in non-decreasing order.\r\nAdding Edges:\r\n\r\nStarting with the edge of the smallest weight, add edges to the MST one by one.\r\nEnsure that adding an edge does not create a cycle in the MST. If adding an edge creates a cycle, skip it.\r\nTermination:\r\n\r\nContinue adding edges until the MST contains (V-1) edges, where V is the number of nodes in the graph.","shortMessageHtmlLink":"Added Kruskal.c"}},{"before":"348868651005b62dd5f742291d05f47470e76811","after":"fe43669ca7a896c7db8176c3dd056f23dc617b55","ref":"refs/heads/main","pushedAt":"2023-11-07T12:31:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Update BFS_DFS.c\n\nBreadth-First Search (BFS) and Depth-First Search (DFS) are fundamental graph traversal algorithms:\r\n\r\nBreadth-First Search (BFS): BFS explores a graph by systematically visiting all the nodes at the current level before moving to the next level. It starts from a designated source node and explores its neighbors first, then moves to their neighbors, and so on. This breadth-first exploration is like ripples in a pond, ensuring that you visit nodes in order of their distance from the source. BFS is useful for finding the shortest path in an unweighted graph and for exploring all nodes within a specific radius from the source.\r\n\r\nDepth-First Search (DFS): DFS, on the other hand, explores as deeply as possible along one branch before backtracking. It starts at the source node, explores one branch completely, then goes back and explores another branch. This depth-first exploration is like exploring a maze by going as far as you can in one direction before turning back. DFS is useful for tasks like topological sorting, cycle detection, and pathfinding but doesn't guarantee the shortest path.","shortMessageHtmlLink":"Update BFS_DFS.c"}},{"before":"2f4c33b07ea56eb7de0b811096f6a48d213c52fe","after":"348868651005b62dd5f742291d05f47470e76811","ref":"refs/heads/main","pushedAt":"2023-11-07T12:28:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Create Prim.c\n\n**Prim's Algorithm** is a greedy approach for finding the Minimum Spanning Tree (MST) in a graph. It starts with an empty set of edges and iteratively adds the edge with the smallest weight that connects a visited node to an unvisited one, marking the latter as visited. This process continues until all nodes are included in the MST, resulting in a tree that spans all nodes with the minimum possible total edge weight. Prim's algorithm efficiently constructs the MST and is widely used in network design and clustering applications.","shortMessageHtmlLink":"Create Prim.c"}},{"before":"a12e172019d07fada180f89eee896c9f392e8650","after":"2f4c33b07ea56eb7de0b811096f6a48d213c52fe","ref":"refs/heads/main","pushedAt":"2023-11-04T08:21:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"adjacency matrix and adjacency list for both included","shortMessageHtmlLink":"adjacency matrix and adjacency list for both included"}},{"before":"323a955a24938705e3165f5921877fdb6c774aca","after":"a12e172019d07fada180f89eee896c9f392e8650","ref":"refs/heads/main","pushedAt":"2023-11-04T08:19:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?s=80&v=4"},"commit":{"message":"Create BFS and DFS (adjacency matrix and adjacency list )","shortMessageHtmlLink":"Create BFS and DFS (adjacency matrix and adjacency list )"}},{"before":null,"after":"323a955a24938705e3165f5921877fdb6c774aca","ref":"refs/heads/main","pushedAt":"2023-11-04T08:12:43.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"AtharvaKulkarniIT","name":"Atharva Kulkarni","path":"/AtharvaKulkarniIT","primaryAvatarUrl":"https://github.com/avatars/u/122991006?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":"Y3Vyc29yOnYyOpK7MjAyMy0xMi0wMlQwMjoyODozOC4wMDAwMDBazwAAAAO960nj","startCursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMi0wMlQwMjoyODozOC4wMDAwMDBazwAAAAO960nj","endCursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMS0wNFQwODoxMjo0My4wMDAwMDBazwAAAAOnQmTp"}},"title":"Activity · AtharvaKulkarniIT/Data-Structures-and-Algorithms"}