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

Inactive Publication Date: 2019-10-25
HEFEI UNIV OF TECH
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Embodiments of the present invention provide a method and device for querying paths between two character nodes in a family tree graph, so as to at

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for inquiring path between two figure nodes in family tree graph
  • Method and device for inquiring path between two figure nodes in family tree graph
  • Method and device for inquiring path between two figure nodes in family tree graph

Examples

Experimental program
Comparison scheme
Effect test

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

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method and a device for inquiring a path between two figure nodes in a family tree graph. The method comprises the steps of acquiring a family tree graph corresponding to a target family tree and two nodes of a to-be-queried path,wherein the family tree graph at least comprises character nodes and attribute information, and the two nodes comprise an initial node and an end node; searching a first precursor node set corresponding to the initial node and a second precursor node set corresponding to the end node, each precursor node set comprising: at least one precursornode for indicating preset attribute information, the precursor node being used for indicating a travelable next node in the path; when the same precursor nodes exist in the first precursor node setand the second precursor node set, sequentially reading the precursor nodes in the first precursor node set and the second precursor node set to obtain a path node set; and determining the shortest path between the two nodes according to the path node set.

Description

technical field [0001] The invention relates to the technical field of genealogy data processing, in particular to a method and device for querying paths between nodes of two characters in a genealogy graph. Background technique [0002] In related technologies, many families with the same surname come from the same family. During the long-term recording process of surname information, a variety of family trees have been formed. However, the current genealogy data is complicated and there is no unified data processing method, which causes many people to query family trees. At the same time, only the kinship relationship between characters within three generations can be known, and the relationship between other characters cannot be known; even if each family tree is digitized to obtain genealogy data, each family tree data is fragmented genealogy data, there is no Statistical processing is also impossible to know the relationship between each person in the family tree graph ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F16/28G06F16/2455
CPCG06F16/2455G06F16/288
Inventor 吴信东盛绍静周鹏
Owner HEFEI UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap