Rohit Gawanderohit253.hashnode.dev·18 hours agoChapter 44: Graphs (Part 2)In the last part of the DSA series, we explored the basic concepts of graphs, such as types of graphs, their representations, and traversals using DFS and BFS. In this chapter, we will dive deeper into the complexities of graphs, introducing more adv...DiscussDSA(Data Structure and Algorithm) In JAVAconnectedgraph

Teja Illaakadurga.hashnode.dev·Oct 2, 2024Djikstra Algorithm in JavaDjikstra Algorithm in Java import java.util.*; public class Main { public static class Node implements Comparable<Node> { public int vertices; public int distance; public Node(int vertices, int distance) { this.vertices = vert...Discussgraph algorithms

Teja Illaakadurga.hashnode.dev·Oct 2, 2024DFS and BFS on a Single GraphBFS and DFS Algorithm on a single Graph Take an Example of the below Graph import java.util.*; public class Main { public static class Graph { int v; int e; List<List<Integer>> arrList; public Graph(int v, int e) { this.v...DiscussDFS

Jyotiprakash Mishrablog.jyotiprakash.org·Sep 25, 2024Introduction to GraphsA graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs are an abstract data structure used to represent relationships between objects. A graph G is typically denoted as G = (V, E), where: V is the set o...Discuss·10 likes·308 readsgraphs

Chetan Dattachetan77.hashnode.dev·Sep 4, 2024M-Coloring ProblemProblem Given an undirected graph and an integer M. The task is to determine if the graph can be colored with at most M colors such that no two adjacent vertices of the graph are colored with the same color. Here coloring of a graph means the assignm...DiscussLeetcodem-coloring-problem

Polkam Srinidhinidhiblog.hashnode.dev·Aug 30, 2024#1 To Check, if Graph is a Tree? in JAVA1. Graph-Style DSA Problem: Is the Graph a Tree? Problem Statement: The problem is to determine whether the given undirected graph is a tree.Conditions to satisfy for sure: A graph is a tree if: It is connected. It does not contain any cycles. It ...Discussgraphs

Tiny Octopustinyoctopus.hashnode.dev·Aug 8, 2024How to Create Accessible Charts in React: A Guide to Inclusive Data VisualisationWhat is Accessibility in Data Visualisation Data visualisation is key to communication but we found that many of the popular charting and graph libraries in ReactJS can be inaccessible to people using a screen reader. Accessibility in data visualisat...DiscussAccessibility

Riyaz Nabiyullariyaz-blog.hashnode.dev·Jul 15, 2024Data Structures - Java: Syntax, Use Case, Time and Space Complexity1. Arrays Syntax: // Declaration and initialization int[] array = new int[10]; int[] array = {1, 2, 3, 4, 5}; // Accessing elements int element = array[0]; // Modifying elements array[1] = 10; Use Cases: Fixed-size collections, fast access by inde...Discuss·44 readsDSA-Javadata structures

Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 25, 2024Understanding the Topological Sort algorithmTopological Sort is a linear ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge 𝑢→𝑣, vertex 𝑢 comes before 𝑣 in the ordering. This pattern is particularly useful in problems involving scheduling, dependency r...DiscussTopological Sort

Arvind Choudharycper.hashnode.dev·Apr 1, 2024Navigating the World of Graphs in Programming: An Essential GuideIntroduction: Graphs are a fundamental data structure in computer science that represent relationships between entities. From social networks to routing algorithms, graphs play a pivotal role in modeling and solving a myriad of real-world problems. I...DiscussProgramming Blogs