CN114510541A - Method and device for displaying relationship graph, storage medium and electronic equipment - Google Patents
Method and device for displaying relationship graph, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN114510541A CN114510541A CN202210406829.6A CN202210406829A CN114510541A CN 114510541 A CN114510541 A CN 114510541A CN 202210406829 A CN202210406829 A CN 202210406829A CN 114510541 A CN114510541 A CN 114510541A
- Authority
- CN
- China
- Prior art keywords
- node
- relation
- relationship
- graph
- direct
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/288—Entity relationship models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/26—Visual data mining; Browsing structured data
Abstract
The disclosure provides a relation graph display method and device, a storage medium and electronic equipment. Determining a target entity, and determining a plurality of entities having direct relation or indirect relation with the target entity; drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge; and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node. According to the scheme, the display state of the map is updated in real time based on the interactive behavior of the user and the map, the map information concerned by the user can be displayed in real time, and the user can visually and clearly know the information concerned by the user.
Description
Technical Field
The present disclosure relates to the field of maps, and in particular, to a method and an apparatus for displaying a relationship map, a storage medium, and an electronic device.
Background
One of the functions of the relationship map is to facilitate users to intuitively and clearly understand the information concerned by the users. Taking enterprise information as an example, other enterprises having a relationship with a target enterprise can be displayed through a relationship map, and the display form of the map can facilitate a user to quickly understand the related information.
In some relational maps, the display difficulty of the knowledge map is high due to the fact that a large number of nodes are included and the nodes have complicated inter-node relations, the existing display mode is not favorable for users to visually and clearly know the concerned information, and the user experience is poor.
Disclosure of Invention
In view of the above shortcomings of the prior art, the present disclosure is directed to a method, an apparatus, a storage medium, and an electronic device for displaying a relationship graph, which are used for displaying graph information focused by a user in real time.
In a first aspect, the present disclosure provides a method for displaying a relationship graph, including:
determining a target entity and determining a plurality of entities having a direct relationship or an indirect relationship with the target entity;
drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge;
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node.
Optionally, the drawing and displaying a relationship graph by using the determined entities as nodes and using the direct relationship between the entities as edges includes:
and taking the target entity as a central node, taking an entity having a direct relation with the central node as a first-level node, taking an entity having a direct relation with the first-level node as a second-level node, and drawing and displaying the relation graph with the N-level nodes by analogy.
Optionally, the updating the display state of the relationship graph based on the direct relationship of the clicked node includes:
and (3) mapping the relationship: carrying out first display processing on the clicked node, the node having a direct relation with the clicked node and the edge representing the direct relation;
and performing second display processing on other parts in the relation map.
Optionally, the first display processing includes:
normally showing the clicked node and a node having a direct relation with the clicked node; edges characterizing the direct relationship are highlighted.
Optionally, the first display processing includes:
highlighting the clicked node, the nodes having a direct relationship with the clicked node, and the edges characterizing the direct relationship.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on nodes of other parts in the relation graph, and performing hiding treatment on edges of other parts in the relation graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and hiding the nodes and edges of other parts in the relational graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on the nodes and edges of other parts in the relation graph.
Optionally, after the display state of the relationship map is updated, the method further includes:
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, continuously updating the display state of the relation graph based on the direct relation of the clicked node.
Optionally, after the display state of the relationship graph is updated, the method further includes:
and restoring the display state of the relationship map to an initial state in response to the click operation of the user on the specified position in the updated relationship map.
Optionally, the specified positions are: positions in the relationship graph except for the clicked node and the node having a direct relationship with the clicked node.
In a second aspect, the present disclosure provides a display device of a relationship graph, including:
the entity determining module is used for determining a target entity and determining a plurality of entities having direct relation or indirect relation with the target entity;
the map drawing module is used for drawing and displaying a relational map by taking the determined entities as nodes and taking the direct relation between the entities as edges;
and the map updating module is used for responding to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation map and updating the display state of the relation map based on the direct relation of the clicked node.
Optionally, the map drawing module, when drawing and displaying the relationship map by using the determined entities as nodes and using the direct relationship between the entities as edges, is configured to:
and taking the target entity as a central node, taking an entity having a direct relation with the central node as a first-level node, taking an entity having a direct relation with the first-level node as a second-level node, and drawing and displaying the relation graph with the N-level nodes by analogy.
Optionally, the graph updating module, when updating the display state of the relationship graph based on the direct relationship of the clicked node, is configured to:
and (3) mapping the relationship: carrying out first display processing on the clicked node, the node having a direct relation with the clicked node and the edge representing the direct relation;
and performing second display processing on other parts in the relation map.
Optionally, the first display processing includes:
normally showing the clicked node and a node having a direct relation with the clicked node; edges characterizing the direct relationship are highlighted.
Optionally, the first display processing includes:
highlighting the clicked node, the nodes having a direct relationship with the clicked node, and the edges characterizing the direct relationship.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on nodes of other parts in the relation graph, and performing hiding treatment on edges of other parts in the relation graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and hiding the nodes and edges of other parts in the relational graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on the nodes and edges of other parts in the relation graph.
Optionally, the map updating module is further configured to:
and responding to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, and continuously updating the display state of the relation graph based on the direct relation of the clicked node.
Optionally, the map updating module is further configured to:
and restoring the display state of the relationship map to an initial state in response to the click operation of the user on the specified position in the updated relationship map.
Optionally, the specified positions are: positions in the relationship graph except for the clicked node and the node having a direct relationship with the clicked node.
In a third aspect, the present disclosure provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method according to the first aspect.
In a fourth aspect, the present disclosure provides an electronic device comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to implement the steps of the method according to the first aspect.
The disclosure provides a relation graph display method and device, a storage medium and electronic equipment. Determining a target entity, and determining a plurality of entities having direct relation or indirect relation with the target entity; drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge; and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node.
According to the scheme, the display state of the map is updated in real time based on the interactive behavior of the user and the map, the map information concerned by the user can be displayed in real time, and the user can visually and clearly know the information concerned by the user.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art according to these drawings.
Fig. 1 is a work flow diagram of a method for displaying a relationship graph provided in the embodiment of the present disclosure;
FIG. 2 is a schematic diagram of an initial display state of a relationship graph provided by an embodiment of the present disclosure;
FIG. 3 is a diagram illustrating an updated display state of a relationship graph according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of an updated display state of another relationship graph provided in an embodiment of the present disclosure;
fig. 5 is a schematic diagram of a continuously updated display state of the relationship graph provided in the embodiment of the present disclosure;
FIG. 6 is a schematic structural diagram of a relationship graph display device provided in the embodiment of the present disclosure
Fig. 7 is a hardware structure diagram of an electronic device for displaying a relationship graph according to an embodiment of the present disclosure.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the embodiments of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, but not all the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present disclosure should fall within the scope of protection of the embodiments in the present disclosure.
The following further describes specific implementations of the embodiments of the present disclosure with reference to the drawings of the embodiments of the present disclosure.
The first embodiment,
An embodiment of the present disclosure provides a method for displaying a relationship graph, as shown in fig. 1, where fig. 1 is a work flow diagram of a method for displaying a relationship graph implemented and provided by the present disclosure, and the method includes the following steps S101 to S103:
s101, determining a target entity and determining a plurality of entities having direct relation or indirect relation with the target entity;
in some embodiments, the entities may be business entities, human entities, animal entities, plant entities, and the like. The direct relation is an entity which has direct association with the target entity, and the indirect relation is an entity which can be associated with the target entity after being associated with the target entity through two layers, three layers or N layers.
In some embodiments, the target entity is an entity of interest to the user, e.g., company a is the target entity if the user is operating to view a relationship graph for company a.
For example, if Business entity 1 is the target entity, and Business entity 1 has a partnering relationship with Business entity 2, then Business entity 2 is the entity that has a direct relationship with Business entity 1. Business entity 3 has a partnering relationship with Business entity 2, then Business entity 3 is an entity having a direct relationship with Business entity 2 and an entity having an indirect relationship with Business entity 1.
S102, drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge;
in some embodiments, the target entity may be used as a central node, an entity having a direct relationship with the central node is used as a first level node, an entity having a direct relationship with the first level node is used as a second level node, and so on, to draw and display a relationship graph having N level nodes. The relationship map at this time is in an initial state.
In some embodiments, in order to avoid the drawn relational graph from being too large, the number of N may be set based on the display area of a single node and the total display area of the graph. For example, limiting N to 3, drawing and presenting a relationship graph with 3 levels of nodes, the node with the furthest indirect relationship to the central node being the level 3 node.
The specific embodiment of the relationship map can be shown in fig. 2. In fig. 2, an entity 1 is a target entity, the entity 1 is used as a central node and extends outward, and an entity having a direct relationship with the entity 1 is used as a first-level node, and the first-level node includes entities 2 to 8. And taking the entity having a direct relation with the first-level node as a second-level node, wherein the second-level node comprises entities 9-11. Entities having a direct relationship with the second level nodes are considered third level nodes, which include the entity 12. By analogy, when N is set to be greater than 3, the fourth level node … … having a direct relationship with the third level node may also be presented.
S103, responding to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, and updating the display state of the relation graph based on the direct relation of the clicked node.
The user may operate the nodes shown in the relationship graph, for example, click any one of the nodes.
In some embodiments, when updating the presentation state of the relationship graph based on the direct relationship that the clicked node has, the method includes the following steps:
s103a, comparing the relationship map: carrying out first display processing on the clicked node, the node having a direct relation with the clicked node and the edge representing the direct relation;
s103b, performing second display processing on other parts in the relation map.
Specifically, in response to a click operation of a user on a node, the embodiment regards a clicked node, a node having a direct relationship with the clicked node, and an edge representing the direct relationship in the graph as the current content of interest of the user, and regards the content of the other part in the graph as the current content of no interest of the user.
The first display processing and the second display processing are different display processing modes, and the user can read and understand the concerned content in the map more conveniently by performing different display on the current concerned content and the unconcerned content of the user.
In some embodiments, the first presentation process comprises: normally showing the clicked node and a node having a direct relation with the clicked node; highlighting edges characterizing the direct relationship, or, in other embodiments, the first presentation process, comprises: highlighting the clicked node, the nodes having a direct relationship with the clicked node, and the edges characterizing the direct relationship.
In some embodiments, the performing a second display process on the other part of the relationship graph includes: and performing desalination treatment on nodes of other parts in the relation graph, and performing hiding treatment on edges of other parts in the relation graph. Or, in another embodiment, the performing, by the second display process, another part in the relationship graph includes: and hiding the nodes and edges of other parts in the relational graph. Still alternatively, in another embodiment, the performing a second display process on another part in the relationship graph includes: and performing desalination treatment on the nodes and edges of other parts in the relation graph.
Referring to fig. 3, fig. 3 is an example of one of the first and second display modes. When the user clicks the entity 2 node in the graph when the graph is in the initial state (as in fig. 2), the display state of the graph is updated. Specifically, the entity 2 node, the entity 1 node and the entity 9 node which have a direct relationship with the entity 2 node, edges between the entity 2 node and the entity 1 node and between the entity 2 node and the entity 9 node are all normally displayed, and nodes and edges of other parts in the graph are all hidden.
Referring to fig. 4, fig. 4 is an example of one of the first and second display modes. When the user clicks the entity 2 node in the graph when the graph is in the initial state (as in fig. 2), the display state of the graph is updated. Specifically, the entity 2 node, the entity 1 node and the entity 9 node which have a direct relationship with the entity 2 node are displayed normally, and the edges between the entity 2 node and the entity 1 node and between the entity 2 node and the entity 9 node are faded.
Further, after the display state of the relationship graph is updated, the display state of the relationship graph can be continuously updated based on the direct relationship of the clicked node in response to the click operation of the user on any node in the plurality of nodes currently displayed by the relationship graph.
Taking fig. 4 and 5 as an example, the nodes currently shown in fig. 4 include an entity 1 node, an entity 2 node, and an entity 9 node. After the user clicks the entity 1 node in the display state shown in fig. 4, the display state of the relationship graph is continuously updated based on the direct relationship of the entity 1 node.
As shown in FIG. 5, the nodes having direct relationship with the entity 1 node include entity 2 node to entity 8 node. And respectively carrying out first display processing on edges among the entity 1 node, the entity 2 node to the entity 8 node and the entity 1 node and the entity 2 node to the entity 8 node, and carrying out second display processing on other nodes and edges in the map. In fig. 5, the first exhibition process is normal exhibition of nodes and edges, and the second exhibition process is fade-out of nodes and edges.
Further, after the display state of the relationship graph is updated, the display state of the relationship graph can be restored to the initial state in response to the click operation of the user on the specified position in the updated relationship graph.
In some embodiments, the specified locations are: positions in the relationship graph except for the clicked node and the node having a direct relationship with the clicked node.
Taking fig. 2 and 5 as an example, in fig. 5, in addition to the positions occupied by the entity 1 node to the entity 8 node, the user clicks any other position in the graph to restore the graph from the updated display state shown in fig. 5 to the initial state shown in fig. 2.
In other embodiments, a restore button may also be provided at a suitable position, and after the user clicks the restore button, the display state of the relationship graph is restored to the initial state.
The disclosure provides a relation graph display method and device, a storage medium and electronic equipment. Determining a target entity, and determining a plurality of entities having direct relation or indirect relation with the target entity; drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge; and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node.
According to the scheme, the display state of the map is updated in real time based on the interactive behavior of the user and the map, the map information concerned by the user can be displayed in real time, and the user can visually and clearly know the information concerned by the user.
Example II,
In a second aspect, an embodiment of the present disclosure further provides a display apparatus of a relationship diagram, as shown in fig. 6, fig. 6 is a schematic structural diagram of the display apparatus 40 of a relationship diagram provided in the embodiment of the present disclosure, where the display apparatus 60 of a relationship diagram includes:
an entity determining module 610, configured to determine a target entity and determine a plurality of entities having a direct relationship or an indirect relationship with the target entity;
the graph drawing module 620 is configured to draw and display a relationship graph by using the determined entities as nodes and using the direct relationship between the entities as edges;
the graph updating module 630 is configured to, in response to a user clicking any one of the plurality of nodes currently displayed by the relationship graph, update the display state of the relationship graph based on a direct relationship of the clicked node.
Optionally, the map drawing module, when drawing and displaying the relationship map by using the determined entities as nodes and using the direct relationship between the entities as edges, is configured to:
and taking the target entity as a central node, taking an entity having a direct relation with the central node as a first-level node, taking an entity having a direct relation with the first-level node as a second-level node, and drawing and displaying the relation graph with the N-level nodes by analogy.
Optionally, the graph updating module, when updating the display state of the relationship graph based on the direct relationship of the clicked node, is configured to:
and (3) mapping the relationship: carrying out first display processing on the clicked node, the node having a direct relation with the clicked node and the edge representing the direct relation;
and performing second display processing on other parts in the relation map.
Optionally, the first display processing includes:
normally showing the clicked node and a node having a direct relation with the clicked node; edges characterizing the direct relationship are highlighted.
Optionally, the first display processing includes:
highlighting the clicked node, the nodes having a direct relationship with the clicked node, and the edges characterizing the direct relationship.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on nodes of other parts in the relation graph, and performing hiding treatment on edges of other parts in the relation graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and hiding the nodes and edges of other parts in the relational graph.
Optionally, the second displaying processing is performed on other parts in the relationship map, and includes:
and performing desalination treatment on the nodes and edges of other parts in the relation graph.
Optionally, the map updating module is further configured to:
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, continuously updating the display state of the relation graph based on the direct relation of the clicked node.
Optionally, the map updating module is further configured to:
and restoring the display state of the relationship map to an initial state in response to the click operation of the user on the appointed position in the updated relationship map.
Optionally, the specified positions are: positions in the relationship graph except for the clicked node and the node having a direct relationship with the clicked node.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
Example III,
The embodiment of the present disclosure further provides a storage medium, where a computer program is stored on the storage medium, and when the processor executes the computer program stored on the storage medium, the method for displaying any relationship graph according to the first aspect of the present disclosure is implemented, where the method for displaying a relationship graph includes, but is not limited to:
determining a target entity and determining a plurality of entities having a direct relationship or an indirect relationship with the target entity;
drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge;
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node.
Example four,
Based on the method for displaying the relationship graph according to the first embodiment of the present disclosure, an electronic device for displaying the relationship graph is further provided in the first embodiment of the present disclosure, as shown in fig. 7, fig. 7 is a schematic diagram of a hardware structure of the electronic device for obtaining the relationship provided in the first embodiment of the present disclosure; the hardware structure of the electronic device may include: a processor 701, a communication interface 702, a computer-readable medium 703 and a communication bus 704;
the processor 701, the communication interface 702 and the computer-readable medium 703 are communicated with each other through a communication bus 707;
optionally, the communication interface 702 may be an interface of a communication module, such as an interface of a GSM module;
the processor 701 may be specifically configured to run the executable program stored in the memory, so as to execute all or part of the methods of any one of the above-described method embodiments.
The Processor 701 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present disclosure may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The present disclosure has thus described specific embodiments of the present subject matter. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may be advantageous.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. The person involved almost always obtains the corresponding hardware circuit configuration by programming the improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the design personnel without requiring the chip manufacturer to design and manufacture a dedicated integrated circuit chip. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the various elements may be implemented in the same one or more software and/or hardware implementations in practicing the disclosure.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The disclosure may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular transactions or implement particular abstract data types. The present disclosure may also be practiced in distributed computing environments where transactions are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only an example of the present disclosure and is not intended to limit the present disclosure. Various modifications and variations of this disclosure will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure should be included in the scope of the claims of the present disclosure.
Claims (14)
1. A method for displaying a relationship graph, which is characterized by comprising the following steps:
determining a target entity and determining a plurality of entities having a direct relationship or an indirect relationship with the target entity;
drawing and displaying a relation graph by taking the determined entities as nodes and taking the direct relation between the entities as an edge;
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, updating the display state of the relation graph based on the direct relation of the clicked node.
2. The method of claim 1, wherein the drawing and displaying the relationship graph with the determined entities as nodes and the direct relationships between the entities as edges comprises:
and taking the target entity as a central node, taking an entity having a direct relation with the central node as a first-level node, taking an entity having a direct relation with the first-level node as a second-level node, and drawing and displaying the relation graph with the N-level nodes by analogy.
3. The method according to claim 1, wherein the updating the presentation state of the relationship graph based on the direct relationship that the clicked node has comprises:
and (3) mapping the relationship: carrying out first display processing on the clicked node, the node having a direct relation with the clicked node and the edge representing the direct relation;
and performing second display processing on other parts in the relation map.
4. The method of claim 3, wherein the first presentation process comprises:
normally showing the clicked node and a node having a direct relation with the clicked node; edges characterizing the direct relationship are highlighted.
5. The method of claim 3, wherein the first presentation process comprises:
highlighting the clicked node, the nodes having a direct relationship with the clicked node, and the edges characterizing the direct relationship.
6. The method according to claim 3, wherein the second presentation process of the other part of the relationship graph comprises:
and performing desalination treatment on nodes of other parts in the relation graph, and performing hiding treatment on edges of other parts in the relation graph.
7. The method according to claim 3, wherein the second presentation process of the other part of the relationship graph comprises:
and hiding the nodes and edges of other parts in the relational graph.
8. The method according to claim 3, wherein the second presentation process of the other part of the relationship graph comprises:
and performing desalination treatment on the nodes and edges of other parts in the relation graph.
9. The method according to claim 5, wherein after updating the display status of the relationship graph, further comprising:
and in response to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation graph, continuously updating the display state of the relation graph based on the direct relation of the clicked node.
10. The method according to claim 1, wherein after updating the display status of the relationship graph, further comprising:
and restoring the display state of the relationship map to an initial state in response to the click operation of the user on the specified position in the updated relationship map.
11. The method of claim 10, wherein the specified location is: positions in the relationship graph except for the clicked node and the node having a direct relationship with the clicked node.
12. An apparatus for displaying a relationship graph, the apparatus comprising:
the entity determining module is used for determining a target entity and determining a plurality of entities having direct relation or indirect relation with the target entity;
the map drawing module is used for drawing and displaying a relational map by taking the determined entities as nodes and taking the direct relation between the entities as edges;
and the map updating module is used for responding to the clicking operation of the user on any node in the plurality of nodes currently displayed by the relation map and updating the display state of the relation map based on the direct relation of the clicked node.
13. A non-transitory computer readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 11.
14. An electronic device, comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to carry out the steps of the method of any one of claims 1 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210406829.6A CN114510541A (en) | 2022-04-19 | 2022-04-19 | Method and device for displaying relationship graph, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210406829.6A CN114510541A (en) | 2022-04-19 | 2022-04-19 | Method and device for displaying relationship graph, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114510541A true CN114510541A (en) | 2022-05-17 |
Family
ID=81555289
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210406829.6A Pending CN114510541A (en) | 2022-04-19 | 2022-04-19 | Method and device for displaying relationship graph, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114510541A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109739859A (en) * | 2018-12-29 | 2019-05-10 | 深圳证券信息有限公司 | A kind of relation map method for drafting, system and relevant apparatus |
| US20190205999A1 (en) * | 2018-01-04 | 2019-07-04 | Facebook, Inc. | Generating Catalog-Item Recommendations Based On Social Graph Data |
| CN112967130A (en) * | 2021-03-18 | 2021-06-15 | 中国工商银行股份有限公司 | Method and device for identifying enterprise association relationship |
| CN113127649A (en) * | 2021-05-07 | 2021-07-16 | 支付宝(杭州)信息技术有限公司 | Map construction method and device |
-
2022
- 2022-04-19 CN CN202210406829.6A patent/CN114510541A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190205999A1 (en) * | 2018-01-04 | 2019-07-04 | Facebook, Inc. | Generating Catalog-Item Recommendations Based On Social Graph Data |
| CN109739859A (en) * | 2018-12-29 | 2019-05-10 | 深圳证券信息有限公司 | A kind of relation map method for drafting, system and relevant apparatus |
| CN112967130A (en) * | 2021-03-18 | 2021-06-15 | 中国工商银行股份有限公司 | Method and device for identifying enterprise association relationship |
| CN113127649A (en) * | 2021-05-07 | 2021-07-16 | 支付宝(杭州)信息技术有限公司 | Map construction method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7366976B2 (en) | Notification channel for computing device notifications | |
| WO2019085615A1 (en) | Data processing method and apparatus for displaying interface content, and processing device | |
| CN106797547B (en) | Operating system support for location cards | |
| CN107426272A (en) | A kind of small routine method for pushing, device and computer-readable storage medium | |
| US8775923B1 (en) | Web page restoration | |
| CN108924029B (en) | Method and device for sending customer service data | |
| WO2023216671A1 (en) | Graph display method and apparatus, storage medium and electronic device | |
| KR20160059998A (en) | An apparatus and method for performing split-screen display | |
| US20110099498A1 (en) | Graphical user interface hierarchy generation | |
| CN109086126A (en) | Task scheduling processing method, apparatus, server, client and electronic equipment | |
| CN109509257A (en) | Indoor floor rank components pattern forming method, terminal and storage medium | |
| CN112015569A (en) | Message reminding processing method and device | |
| US9043464B1 (en) | Automatically grouping resources accessed by a user | |
| CN116719591A (en) | Stock right map display method and device, storage system and electronic equipment | |
| CN114510541A (en) | Method and device for displaying relationship graph, storage medium and electronic equipment | |
| CN104428757B (en) | The integrated diagnosis information in development environment | |
| CN110007815A (en) | A kind of air navigation aid and device of application | |
| CN115080671B (en) | Method and device for creating user-defined relationship graph, storage medium and electronic equipment | |
| CN111967769A (en) | Risk identification method, device, equipment and medium | |
| CN117033527B (en) | Knowledge graph construction method and device, storage medium and electronic equipment | |
| CN115048904B (en) | Entity display method and device, storage medium and electronic equipment | |
| CN114611479A (en) | Document generation method and device, storage medium and electronic equipment | |
| CN110262724B (en) | Menu display method, device and equipment | |
| CN106855803A (en) | A kind of icon display method and device | |
| CN113821229A (en) | Program installation method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |