Method and device for inquiring path between two figure nodes in family tree graph
A query method and inter-node technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem of being unable to quickly and effectively analyze the shortest path between two character nodes, so as to improve retrieval efficiency and reduce retrieval space , The effect of convenient traceability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0036] According to an embodiment of the present invention, an embodiment of a method for querying paths between nodes of two characters in a family tree is provided. It should be noted that the steps shown in the flow charts of the accompanying drawings can be performed in, for example, a set of computer-executable instructions. computer system, and although a logical order is shown in the flowcharts, in some cases the steps shown or described may be performed in an order different from that shown or described herein.
[0037] The method for querying paths between nodes of two persons in the family tree in the following embodiments of the present invention can be applied to the target family tree.
[0038] figure 1 It is a flow chart of an optional path query method between two character nodes in a family tree diagram according to an embodiment of the present invention, as shown in figure 1 As shown, the method includes the following steps:
[0039] Step S102, obtaining the...
Embodiment 2
[0076] image 3 is a schematic diagram of an optional path query device between two character nodes in a family tree according to an embodiment of the present invention, which is applied to a target family tree, such as image 3 As shown, the path query device includes: an acquisition unit 31, a search unit 33, a reading unit 35, and a determination unit 37, wherein,
[0077]An acquisition unit 31, configured to acquire a family tree graph corresponding to the target family tree and two nodes of the path to be queried, wherein the family tree graph at least includes: a character node and attribute information, and the two nodes include: an initial node and an end node;
[0078] A searching unit 33, configured to search for a first set of pioneer nodes corresponding to the initial node and a second set of pioneer nodes corresponding to the end node, wherein each set of pioneer nodes contains: at least one pioneer node indicating preset attribute information, The pioneer node i...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com