Prime number marking-based cyclic graph branchlet existence query method
A query method and technology of directed acyclic graph, which is applied in the field of querying the existence of twigs in cyclic graphs based on prime number marks, can solve the problems of not supporting cyclic graph query, low query efficiency, and not supporting twig query, etc., and achieve reduction Space overhead, reduce time overhead, and broaden the effect of application range
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0031] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.
[0032] like figure 1 As shown, the circled graph G in the embodiment of the present invention is given, and the nodes contained in the circled graph G are respectively v1, v2, v3, v4, v5, v6, and v7, and their categories are respectively a, b, and e , b, d, c, b. like figure 2 As shown, the twig T to be queried in the embodiment of the present invention is given. The nodes contained in the twig T are respectively u1, u2, .u3, and u4, and their categories are respectively a, b, c, and d.
[0033] like image 3 As shown, the directed acyclic graph G′ transformed from the cyclic graph G is given, figure 1 The three nodes v1, v2, and v3 in the cyclic graph G are a strongly connected component of G, and are merged into a node v1' of the directed acyclic graph G'. The category of the v1' node is the union a, b, e of the three node categories of v1, v2, ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


