0 views collected around this technical thread.
This article presents the LeetCode 1514 'Maximum Probability Path' problem, explains the algorithm using a priority‑queue approach, provides full Java and C++ implementations, and concludes with a promotional book giveaway encouraging readers to follow the public account.
This article presents LeetCode problem 1514, which asks for the path with the highest success probability in an undirected weighted graph, explains the problem statement, constraints, and provides detailed Java and C++ implementations using a priority‑queue based Dijkstra‑like algorithm.
This article presents LeetCode problem 797, which asks for all possible paths from node 0 to node n‑1 in a directed acyclic graph, explains the DFS approach, lists constraints and examples, and provides complete implementations in Java, C++, C, and Python.
This article examines how misconfigured Kubernetes RBAC permissions can lead to privilege escalation across clusters, presents a graph‑based model to represent users, roles, and authorities, and provides code examples and Cypher queries for detecting and visualizing high‑risk permission paths.
This article introduces and compares major database categories—including relational, key‑value, document, columnar, graph, and time‑series databases—explaining their structures, typical use cases, and advantages, helping readers understand when to choose each type for various applications.
This article introduces the basic concepts of graphs, including vertices, edges, directed and undirected types, explains common storage methods such as adjacency matrices and adjacency lists with examples, and demonstrates graph traversal techniques like depth‑first and breadth‑first search using Java code.
This article describes how Du Xiaoman Financial designed, built, and continuously optimized a massive graph platform—including data governance, graph learning, query performance, data import, and online deployment—to improve credit risk assessment using billions of nodes and edges, and shares practical lessons on graph databases, distributed training, and real‑time inference.
This article introduces graph fundamentals, various application scenarios such as science, code logic, Spark workflows, social networks, and event graphs, then details graph data modeling, analysis, matrix computations, and the deployment of graph neural networks using frameworks like DGL, highlighting practical engineering considerations.
This article explains the concepts of task scheduling dependencies and workflow, introduces graph theory basics such as vertices, edges, and DAGs, and provides a complete Go implementation—including graph structures, BFS traversal, topological sorting, and concurrent execution—to efficiently manage dependent tasks in distributed systems.
The article describes how to enforce architectural rules and assess change impact in a modularized JavaScript application by extracting import statements via AST, building a file‑map, constructing a cycle‑aware dependency graph with indexed nodes, and traversing it with a visited‑stack to support forward and reverse analysis across business and public bundles.
This article explains what NoSQL databases are, introduces the CAP theorem that underlies their design trade‑offs, outlines typical application scenarios, discusses their limitations, classifies the main NoSQL families, and reviews four widely used systems—Redis, HBase, Cassandra, and MongoDB.
This article explains the limitations of traditional relational databases, introduces the emergence of NoSQL, categorizes its four main types—key‑value, document‑oriented, column‑family, and graph—detailing popular products, typical use cases, and scenarios where each is unsuitable.