Help Center> Graph Engine Service> User Guide> Algorithms> Circle Detection with a Single Vertex
Updated on 2024-01-03 GMT+08:00
View PDF

Circle Detection with a Single Vertex

Overview

This algorithm solves a classic graph problem: detecting loops in a graph. The vertices on a loop (circle) are import.

Application Scenarios

This algorithm is widely used for transportation networking and financial risk control.

Parameter Description

Table 1 Algorithm parameters

Parameter

Mandatory

Description

Type

Value Range

Default Value

source

Yes

ID of the given vertex

String

-

-

min_circle_length

No

Minimum circle length

Int

[3,15]

3

max_circle_length

No

Maximum circle length. The value must be bigger than min_circle_length.

Int

[3,15]

10

limit_circle_number

No

Maximum number of circles you want to search for

Int

[1,100000]

100
Parent topic: Algorithms