Graph Algorithms in SQL

Weakly Connected Components

The Weakly Connected Components algorithm finds sets of connected nodes in an undirected graph where each node is reachable from any other node in the same set. Unlike the Strongly Connected Components algorithm which needs a path to exist in both directions between nodes, the Weakly Connected Components algorithm only needs a path to exist in one direction between sets of nodes.

Network of Connected Entities

Weakly connected components identified

Sample use cases

Fraud Detection

Analyzing anomalies in distinct disconnected groups of criminals or suspects

Data Management

Tracking clusters of database records, to detect duplicate data entries

Social Media

Generating friendship recommendations in disconnected groups

Graph Analytics

Performing preliminary network structure discovery

Computer Science

Enabling other algorithms to run independently on identified clusters

Model a Timbr SQL Knowledge Graph in just a few minutes and learn how easy it is to explore and query your data with the semantic graph

Model a Timbr SQL Knowledge Graph in just a few minutes and learn how easy it is to explore and query your data with the semantic graph

Register to try for free

The information you provide will be used in accordance with the terms of our privacy policy.

How can we serve you?