Loop detection method and device in directed graph, equipment and storage medium
A loop detection and directed graph technology, applied in the field of graph theory, can solve the problems of low efficiency, inability to guarantee loop detection, long time consumption, etc., to achieve the effect of improving execution efficiency, improving detection rate, and improving detection efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0079] figure 2 It is a flowchart of a loop detection method in a directed graph in Embodiment 1 of the present application. The embodiment of the present application is suitable for detecting loops in a directed graph, but not for loops with repeated vertices checkout. The method is executed by the loop detection device in the directed graph, the device is realized by software and / or hardware, and is specifically configured in an electronic device with a certain data computing capability.
[0080] Such as figure 2 The shown loop detection method in a directed graph is applied to a distributed cluster, and the distributed cluster includes a service center and multiple computing nodes communicatively connected to the service center. The service center is used to distribute tasks to the computing nodes, and reprocess the information returned by the computing nodes to obtain all the cycles in the directed graph. In this embodiment, the electronic device may be a service cent...
Embodiment 2
[0099] image 3 It is a flow chart of a loop detection method in a directed graph in Embodiment 2 of the present application. This embodiment of the present application is optimized and improved on the basis of the technical solutions of the foregoing embodiments.
[0100] Further, the operation "the service center splices the obtained loops and / or links according to the cut edge information between the subgraphs to obtain the loops in the directed graph" is refined into "the service center acquires In the loop sequence and chain sequence, find the adjacent sequence of the first trimming sequence; the service center will splice the adjacent sequence and the first trimming sequence to obtain a new first trimming sequence; if the new first trimming sequence does not exist Repeat the vertex, the service center judges whether there is a directed edge at the beginning and end of the new first tangent edge sequence; if it exists, the service center detects the new first tangent edge...
Embodiment 3
[0133] Figure 4 It is a flowchart of a loop detection method in a directed graph in Embodiment 3 of the present application. The embodiment of the present application is suitable for detecting loops in a directed graph, but not for loops with repeated vertices checkout. The method is executed by the loop detection device in the directed graph, the device is realized by software and / or hardware, and is specifically configured in an electronic device with a certain data computing capability.
[0134] Such as Figure 4 The shown loop detection method in a directed graph is applied to a distributed cluster, and the distributed cluster includes a service center and multiple computing nodes communicatively connected to the service center. The service center is used to distribute tasks to the computing nodes, and reprocess the information returned by the computing nodes to obtain all the cycles in the directed graph. In this embodiment, the electronic device can be any computing ...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com