Circle Detection with a Single Vertex

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

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

**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

Thank you very much for your feedback. We will continue working to improve the documentation.

The system is busy. Please try again later.