Dhiren Mathurformomentum.shblog.momentum.sh·Jul 1, 2024Leveraging Codebase Knowledge Graphs for Agentic Code GenerationAn agent generating code with language models can face several challenges without sufficient context about the codebase: Duplicating functionality due to lack of awareness of existing functions and classes Violating design patterns and architecture...Discuss·2 likes·140 readslangchain
Code Skycodesky.cloudhero.in·Jul 1, 2024Integrating Graph Databases with GenAI to Identify Fraud in TransactionsIntroduction Fraud detection in financial transactions is a critical concern for businesses and financial institutions. Traditional methods often struggle to keep up with the sophisticated techniques used by fraudsters. However, by integrating graph ...Discussgenai
Abhilietcode.hashnode.dev·Jun 30, 2024Evaluate Division - BFSYou are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [A<sub>i</sub>, B<sub>i</sub>] and values[i] represent the equation A<sub>i</sub> / B<sub>i</sub> = values[i]. Each A<sub>i</sub> or B<sub>i<...DiscussGraphsBFS
Abhilietcode.hashnode.dev·Jun 30, 2024Word Ladder - BFSExample 1: Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"] Output: 5 Explanation: One shortest transformation sequence is "hit" -> "hot" -> "dot" -> "dog" -> cog", which is 5 words long. Example 2: Input: ...DiscussGraphsgraph database
Abhilietcode.hashnode.dev·Jun 30, 2024Flood Fill - BFSAn image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image. You are also given three integers sr, sc, and color. You should perform a flood fill on the image starting from the pixel image[sr][sc]....Discuss·1 likeGraphsBreadth-Fist-Search
Abhilietcode.hashnode.dev·Jun 29, 2024Find All Paths From Source to Target - GraphProblem Statement Given a directed acyclic graph (DAG), find all paths from the source node (node 0) to the target node (the last node). The graph is represented as an adjacency list where graph[i] is a list of all nodes i can directly reach. Example...DiscussGraphsgraph database
Abhilietcode.hashnode.dev·Jun 27, 2024Graph : Depth-First Search (DFS)Explain the Problem Implement the Depth-First Search (DFS) algorithm for graph traversal. Given a graph and a starting vertex, traverse the graph in depth-first order and print the vertices in the order they are visited. Example: Input: Graph: 0: [1...DiscussGraphsgraph database
Abhilietcode.hashnode.dev·Jun 27, 2024Graph - Breadth-First Search (BFS)Explain the Problem Implement the Breadth-First Search (BFS) algorithm for graph traversal. Given a graph and a starting vertex, traverse the graph in breadth-first order and print the vertices in the order they are visited. Example: Input: Graph: 0...DiscussGraphsgraph database
Souvik Mukherjeesouvik150.com·May 30, 2024Navigating Connections: A Beginner's Guide to Graph Databases with Neo4jIn today's data-driven world, managing and analyzing complex relationships efficiently is crucial. Traditional relational databases often struggle with handling connected data effectively. This is where graph databases shine, offering a more intuitiv...Discuss·27 readsNeo4j
Ezaan Aminezaan.hashnode.dev·May 17, 2024Navigating Data Pagination Pitfalls: A Developer’s Journey with Neo4j and Browser CompatibilityWhen I started my Heal Together project, I knew there would be many challenges, but I was ready to take them head-on and improve as a developer. Because this is how you grow — you face challenges that seem impossible, and you conquer them. Before del...DiscussNeo4j