Help Center/ Graph Engine Service/ User Guide/ Algorithms/ Subgraph Matching
Updated on 2022-09-15 GMT+08:00
View PDF

Subgraph Matching

Overview

The subgraph matching algorithm is used to find all subgraphs of a given small graph that is isomorphic to a given large graph. This is a basic graph query operation and is intended to explore important substructures of a graph.

Application Scenarios

This algorithm is applicable to fields such as social network analysis, bioinformatics, transportation, crowd discovery, and anomaly detection.

Parameter Description

Table 1 Subgraph matching parameters

Name

Mandatory

Description

Type

Value Range

edges

Yes

Edge set of the subgraph to be matched. The vertex ID must be a non-negative integer.

String

The value is in standard CSV format. The start and end vertices of an edge are separated by a comma (,), and edges are separated by a newline character (\n). For example, 1,2\n2,3.

vertices

Yes

Label of each vertex on the subgraph to be matched.

String

The value is in standard CSV format. Vertices and their labels are separated by commas (,), and labels are separated by newline characters (\n). For example, 1,BP\n2,FBP\n3,CP.

directed

No

Whether the graph is directed

Bool

The value can be true or false. The default value is true.

n

No

Maximum number of subgraphs to be searched for

Int

The value range is [1,100000]. The default value is 100.

batch_number

No

Number of queries processed in batches each time

Int

The value range is [1,1000000]. The default value is 10000.

statistics

No

Whether to display the number of all subgraphs that meet the conditions

Bool

The value can be true or false. The default value is false.
Parent topic: Algorithms