QI Nan-nan
Abstract
According to the property of the adjacency list of graphs,the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.This algorithm is an effective algorithm by a specific instance validated.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to the property of the adjacency list of graphs,the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.This algorithm is an effective algorithm by a specific instance validated.
Key concepts: Adjacency list, Computer science, Data structure, Adjacency matrix, Breadth-first search, Algorithm, Search algorithm, Property (philosophy)