Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Centroid Decomposition for Tree Algorithms: A Comprehensive GuideIntroduction In the realm of algorithm design, tree algorithms are among the most fundamental and widely used techniques. Trees, being hierarchical data structures, appear in a variety of real-world problems, from computer networks and database index...10 likesCentroidDecomposition
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Tarjan’s Algorithm for Strongly Connected ComponentsIntroduction In the world of graph theory, understanding the relationships between nodes is crucial, especially in directed graphs where the direction of edges matters. One of the most important concepts in this area is the Strongly Connected Compone...8 likesDepthFirstSearch
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Dijkstra’s Algorithm: Finding the Shortest PathIntroduction Dijkstra's Algorithm is one of the most widely used algorithms in graph theory. It efficiently finds the shortest path from a source vertex to all other vertices in a weighted graph. Named after Edsger W. Dijkstra, who introduced it in 1...8 likesDijkstrasAlgorithm
Jyothishree Rajkumarjyothishree.hashnode.dev·Nov 10, 2024Union Find Algorithm(Graph Theory)- Beginner friendly explanationIf you are learning about graphs, then there is one thing that u must keep in your mind, that everything will not be understandable in a single go. Visualization helps a lot. But these concepts are essential in DSA point of view, if you are trying to...2 likes·39 readsunion find
Rohit Gawanderohit253.hashnode.dev·Sep 29, 2024Chapter 44: Graphs (Part 1)In this chapter, we will embark on an in-depth exploration of Graphs, one of the most versatile and widely-used data structures in computer science. Graphs play a crucial role in representing relationships between entities, making them indispensable ...DSA(Data Structure and Algorithm) In JAVAData Structures and Algorithm
Uttam Mahatauttammahata.hashnode.dev·Sep 28, 2024Introduction to GraphsGraph A graph G=(V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints. An edge is said to connect its endpoints. Types of Graphs Directed G...Graph AlgorithmsBasics of Graphs
Drake Phamtopological-sort.hashnode.dev·Sep 28, 2024Topological Sort: Understanding the Concept and 2 ApplicationsTopological Sorting is an important concept in graph theory, especially for Directed Acyclic Graphs (DAGs). It gives a linear order of vertices so that for every directed edge u → v, vertex u comes before v in the order. This is useful when tasks or ...algorithms
Pierre-Yves Ricaublog.p-y.wtf·Sep 25, 2024Rendering the Java heap as a TreemapExploring heap dumps I have investigated many heap dumps over the years, and I usually switch back and forth between two tools: YourKit Java Profiler to poke around the heap and look for interesting things (ask your company to buy a license!) Shark...5 likes·3.3K readsComputer Science
Pronod Bharatiyadata-intelligence.hashnode.dev·Sep 14, 2024Leveraging Graph Neural Networks on the CORA Dataset: Tackling Non-IID and Non-Euclidean Data with Graph TheoryIn traditional machine learning models, including neural networks, data is often assumed to follow the IID (independent and identically distributed) assumption. This means each data point is independent of others and follows the same underlying proba...387 readsGraph Neural Networks (GNNs)CORA Dataset
Pronod Bharatiyadata-intelligence.hashnode.dev·Sep 14, 2024Graph Theory Algorithms and Neural Networks: An In-Depth ExplorationGraph theory and neural networks are two seemingly distinct fields in computer science and mathematics, but they have an intrinsic connection that has become increasingly significant as advancements in both areas have evolved. Graph theory, which dea...594 readsGraph Neural Networks (GNNs)graph theory