gayatri kumargeekee.hashnode.dev·Oct 19, 2024The Ant Colony’s NetworkImagine walking through a vast ant colony where thousands of chambers are interconnected by tunnels. Each tunnel leads to a different chamber, and every chamber has multiple paths leading out. This labyrinth is more than just a network of tunnels; it...Discuss·30 likesData Structures and AlgorithmsGraph
Rohit Gawanderohit253.hashnode.dev·Oct 14, 2024Chapter 39: Graphs (Part 5)"Mastering Graph Algorithms: Cheapest Flights, Connecting Cities, and More in Java" Introduction In this chapter, we delve deeper into the fascinating world of graphs, focusing on practical applications related to finding optimal paths and connectio...DiscussDSA(Data Structure and Algorithm) In JAVARohitGawande
Kofi / IllestpreachaProblog.illestpreacha.com·Oct 9, 2024Mathober2024_FlexibleGraphableOres For my eighth sketch of Mathober2024, GraphableOres is coded in Python with a Ore-like graph that is being stretched and morphed through Glitchlab. Flexible Graph is the 7th Prompt for this year’s Mathober. Poetry Shaking and Flipping T...DiscussPython
Raineraineyang.hashnode.dev·Oct 7, 2024Journey to PythonTA: The Control Flow Graph Module (Part 1)The Journey to PythonTA series aims to introduce various system components of PythonTA (https://github.com/pyta-uoft/pyta), a static code analysis tool for checking common code style errors in Python code, to new developers. In this series, in additi...Discuss·30 readsPython
Dharansh Neemadharanshneema.hashnode.dev·Sep 25, 2024DFS and BFS in graph using Adjacency matrixTerminologies Graph : In DSA generally Graph means set of nodes which are connected to each other (not necessarily). A graph can be collection of nodes which are not connected to each other(disjoined graph). The graph is composed of Vertex and Edges...Discuss·10 likesGraph
Raineraineyang.hashnode.dev·Aug 9, 2024PyTA Project: Augment CFG Edges with Z3 ConstraintsToday's task requires a combination of various components of PythonTA introduced in previous articles, including control flow graph module, Z3 visitor, and Z3 expression wrapper. In this task, we will augment each control flow graph edge with a list ...DiscussPython
Pawan Gangwaniblogs.pgangwani.co.in·Jul 31, 2024Playwright testing with JanusGraphThis article covers how to connect to multiple JanusGraph instances in Playwright using TypeScript, manage connections securely with environment variables, and utilize custom fixtures for setup and teardown. Prerequisites Node.js and TypeScript inst...Discuss·29 readsjanus
Sean Coughlinblog.seancoughlin.me·Jul 2, 2024Mastering LeetCode: Solving the Lowest Common Ancestor of a Binary Tree ProblemSolving the Lowest Common Ancestor of a Binary Tree on LeetCode Introduction Finding the Lowest Common Ancestor (LCA) of two nodes in a binary tree is a classic problem often encountered in coding interviews and algorithm studies. Understanding how t...Discuss·67 readsSWE Interview Preparationleetcode
Sean Coughlinblog.seancoughlin.me·Jun 29, 2024Rotting Oranges: A Comprehensive Guide to Solving with BFS in PythonIntroduction In this article, we delve into solving the Rotting Oranges problem using the Breadth-First Search (BFS) algorithm in Python. Understanding this problem not only helps in mastering BFS but also enhances problem-solving skills in grid-base...Discuss·75 readsSWE Interview Preparationleetcode
Tapan Rachchhtapanrachchh.hashnode.dev·Jun 29, 20242192. All Ancestors of a Node in a Directed Acyclic Graphclass Solution: def getAncestors(self, n: int, edges: List[List[int]]) -> List[List[int]]: visited = set() adjList = defaultdict(set) parents = defaultdict(set) # Create adjacency list for (a, b) in edges:...Discussleetcode
