Articles by Tag #graph

Browse our collection of articles on various topics related to IT technologies. Dive in and explore something new!

PuppyGraph on MongoDB: Native Graph Queries Without ETL

Structured data across a wide range of workloads—from product catalogs to telemetry streams to user...

Learn More 25 0Apr 22

Implementing Graphs in Golang Without Starting from Scratch

Have you ever imagined a world without connections? Think about your social media full of random...

Learn More 10 2Jul 27

Get a gist of graph data structure here...

This blog is for developers who want to get the gist of a concept and not beat around the bush. We...

Learn More 1 2Dec 10 '24

Remove Methods from project

Problem TC: O(n*m) where n is the no. of nodes and m is the max no. of nodes/methods present in a...

Learn More 1 0Oct 6 '24

YugabyteDB as a Graph database with PuppyGraph

PostgreSQL can handle any workload without streaming data to a purpose-built database. This includes...

Learn More 1 0Oct 7 '24

DevLog 20250805: Divooka Node Graph File Formats

Preamble When I first envisioned Divooka, I aimed for open source, open file formats, and...

Learn More 1 0Aug 6

Visualize the preferences of cats

Occasionally, I saw an article named "Why do cats...?", which analyzed some preferences and behaviors...

Learn More 1 1Sep 2 '24

HelixDB: The Blazing-Fast Graph-Vector Database You Need to Check Out!

Quick Summary: 📝 HelixDB is a graph-vector database built in Rust, designed for RAG and AI...

Learn More 0 0Aug 3

Safest Walk through the grid

Problem class Solution { public boolean findSafeWalk(List<List<Integer>> grid, int...

Learn More 0 0Jul 12

Bidirectional Enhancement of Graph and Agent

Chat2Graph is a graph-native agentic system powered by Ant Group TuGraph team and designed to bridge...

Learn More 0 0May 4

Path with minimum effort

Problem class Solution { public int minimumEffortPath(int[][] heights) { ...

Learn More 0 0Jul 12

Minimum obstacle removal to reach corner

TC:O(n*mlog(n*m)) SC :O(n*m) Problem //BFS : dijkstra's class Solution { public int...

Learn More 0 0Jan 18

connected components

connected components What Are Connected Components? In graph theory, a connected component...

Learn More 0 0Apr 5

Graph is fun, check this blog to find out how

Get a gist of graph data structure here... vidhi-thakur ・...

Learn More 0 0Jan 29

[Boost]

PuppyGraph on MongoDB: Native Graph Queries Without ETL ...

Learn More 0 0May 7

How to Determine if a Graph is Not Simple Without Checking Every Edge for Loops or Parallelism

Graphs are an essential part of graph theory and have applications across various domains, from...

Learn More 0 0Sep 22 '24

LeetCode Flood Fill Solved — DFS Clicked at 1 AM 😴

🧩 The Problem: Flood Fill (LeetCode #733) You’re given a 2D image represented as a grid, where each...

Learn More 0 0Jul 29

Find safest walk through the grid

problem TC: O(n*m) , SC :O(n*m) + O(n*m) int Directions[][] = ...

Learn More 0 0Oct 7 '24

Negative cycle with Dijskta(Possible but not optimal)

I decided to experiment with Dijkstra’s algorithm to solve a problem that may involve negative...

Learn More 0 0Oct 10 '24

Dijstras ‘algorithm graph.

I am doing an algorithm graph Dijstras in C# . I now know the best priority queue you use . How do...

Learn More 0 0Feb 1

Graph to store your security data?

The Challenge: You run a multi-tenant security platform and need to ensure full tenant isolation,...

Learn More 0 0Aug 17

3108. Minimum Cost Walk in Weighted Graph

Problem TC: O(n*4alpha) class Solution { public int[] minimumCost(int n, int[][] edges,...

Learn More 0 0Mar 20

Swim in rising water

Problem class Solution { public int swimInWater(int[][] grid) { Queue<Data> q =...

Learn More 0 0Jul 12

Number of islands

Problem Time complexity: O(M∗N)O(M*N)O(M∗N) , since we are traversing all the cell in the...

Learn More 0 0Sep 26 '24

3543. Maximum Weighted K-Edge Path

Problem BFS: TLE class Solution { public int maxWeight(int n, int[][] edges, int k, int t) { ...

Learn More 0 0May 21

Struggling with Presenting My Graph-Based Recommendation System

Introduction I'm working on a graph-based video recommendation system, inspired by a research paper....

Learn More 0 0Mar 21

Grid Teleportation Traversal

Problem TC : vlogv, where v = m*n class Solution { public int minMoves(String[] matrix) { ...

Learn More 0 0May 18

AMAZON NEPTUNE🪐

Amazon Neptune is a managed graph database for connected data, ideal for recommendations, social...

Learn More 0 0Jan 23

Kuzu: The Rocket-Powered Graph Database You Need to Check Out!

Quick Summary: 📝 Kuzu is an embedded graph database designed for speed and scalability,...

Learn More 0 0Apr 22

Clone graph

O(n) : where n is no. of nodes Problem /* Definition for a Node. class Node { public int val; ...

Learn More 0 0Mar 20