Method and apparatus for printing relational graph

1. A method for printing a relational graph, comprising:

determining whether an overall view of a to-be-printed relational graph exceeds a set print size;

in response to the overall view of the to-be-printed relational graph exceeding the set print size, clustering nodes in the to-be-printed relational graph according to the set print size and attribute information of the nodes to form a clustered overall view of the relational graph and subviews of the relational graph; and

printing the clustered overall view of the relational graph after clustering the nodes and the subviews formed based on the clustered nodes.

2. The method according to claim 1 , further comprising:

in the overall view of the to-be-printed relational graph, scaling down regions corresponding to respective clusters of nodes obtained by clustering the nodes to obtain the clustered overall view of the relational graph; or

in the overall view of the to-be-printed relational graph, displaying each cluster of nodes, obtained by clustering the nodes, as a node to obtain the clustered overall view of the relational graph.

3. The method according to claim 1 , wherein printing the subviews formed by the clustered nodes comprises, for each cluster of nodes obtained by clustering:

in response to a subview formed by the cluster of nodes is within the range of the set print size, printing the subview formed by the cluster of nodes; and

in response to the subview formed by the cluster of nodes exceeds the set print size,

re-clustering the cluster of nodes according to attribute information of the cluster of nodes to obtain clusters of next-level nodes, so that a subview formed by the cluster of nodes after the re-clustering is within the range of the set print size; and

printing the subview formed by the cluster of nodes after the re-clustering.

4. The method according to claim 3 , further comprising:

in the subview formed by the cluster of nodes, scaling down regions corresponding to clusters of next-level nodes obtained by the re-clustering to obtain a subview formed by the cluster of nodes after the re-clustering; or

in the subview formed by the cluster of nodes, displaying each cluster of next-level nodes obtained by the re-clustering as a node to obtain a subview of the cluster of nodes after the re-clustering.

5. The method according to claim 3 , further comprising:

printing subviews formed by the cluster of next-level nodes after the re-clustering.

6. The method according to claim 5 , further comprising:

in response to the subview formed by the cluster of next-level nodes exceeds the set print size, re-clustering the cluster of next-level nodes according to attribute information of the cluster of next-level nodes to obtain clusters of further next-level nodes, so that a re-clustered subview formed by the cluster of next-level nodes after the re-clustering is within the range of the set print size.

7. The method according to claim 1 , wherein the subviews formed by the clustered nodes comprise:

subviews formed by clusters of nodes obtained by clustering, wherein a subview formed by a cluster of nodes is a maximal connected subgraph comprising this cluster of nodes.

8. An apparatus for printing a relational graph, comprising:

a memory storing a set of instructions; and

at least one processor configured to execute the set of instructions to cause the apparatus to perform:

determining whether an overall view of a to-be-printed relational graph exceeds a set print size;

in response to the overall view of the to-be-printed relational graph exceeding the set print size, clustering nodes in the to-be-printed relational graph according to the set print size and attribute information of the nodes to form a clustered overall view of the relational graph and subviews of the relational graph; and

printing the clustered overall view of the relational graph after clustering the nodes and the subviews formed based on the clustered nodes.

9. The apparatus according to claim 8 , wherein the at least one processor is further configured to execute the set of instructions to cause the apparatus to perform:

in the overall view of the to-be-printed relational graph, scaling down regions corresponding to respective clusters of nodes obtained by clustering the nodes to obtain the clustered overall view of the relational graph; or

in the overall view of the to-be-printed relational graph, displaying each cluster of nodes, obtained by clustering the nodes, as a node to obtain the clustered overall view of the relational graph.

10. The apparatus according to claim 8 , wherein the at least one processor is further configured to execute the set of instructions to cause the apparatus to perform:

for each cluster of nodes obtained by clustering, in response to a subview formed by the cluster of nodes is within the range of the set print size, printing the subview formed by the cluster of nodes; and

in response to the subview formed by the cluster of nodes exceeds the set print size,

re-clustering the cluster of nodes according to attribute information of the cluster of nodes to obtain clusters of next-level nodes, so that a subview formed by the cluster of nodes after the re-clustering is within the range of the set print size; and

printing the subview formed by the cluster of nodes after the re-clustering.

11. The apparatus according to claim 10 , wherein the at least one processor is further configured to execute the set of instructions to cause the apparatus to perform:

in the subview formed by the cluster of nodes, scaling down regions corresponding to clusters of next-level nodes obtained by the re-clustering to obtain a subview formed by the cluster of nodes after the re-clustering; or

in the subview formed by the cluster of nodes, displaying each cluster of next-level nodes obtained by the re-clustering as a node to obtain a subview of the cluster of nodes after the re-clustering.

12. The apparatus according to claim 10 , wherein the at least one processor is further configured to execute the set of instructions to cause the apparatus to perform:

printing subviews formed by the cluster of next-level nodes after the re-clustering.

13. The apparatus according to claim 8 , wherein the subviews formed by the clustered nodes comprise:

subviews formed by clusters of nodes obtained by clustering, wherein a subview formed by a cluster of nodes is a maximal connected subgraph comprising this cluster of nodes.

14. A non-transitory computer readable storage medium storing a set of instructions that are executable by one or more processing devices to cause a computer to perform a method for printing a relational graph, the method comprising:

determining whether an overall view of a to-be-printed relational graph exceeds a set print size;

in response to the overall view of a to-be-printed relational graph exceeding the set print size, clustering nodes in the to-be-printed relational graph according to the set print size and attribute information of the nodes to form a clustered overall view of the relational graph and subviews of the relational graph; and

printing the clustered overall view of the relational graph after the clustering the nodes and the subviews formed based on the clustered nodes.

15. The non-transitory computer readable storage medium according to claim 14 , wherein the method further comprises:

in the overall view of the to-be-printed relational graph, scaling down regions corresponding to respective clusters of nodes obtained by clustering the nodes to obtain the clustered overall view of the relational graph; or

in the overall view of the to-be-printed relational graph, displaying each cluster of nodes, obtained by clustering the nodes, as a node to obtain the clustered overall view of the relational graph.

16. The non-transitory computer readable storage medium according to claim 14 , wherein printing the subviews formed by the clustered nodes comprises, for each cluster of nodes obtained by clustering:

in response to a subview formed by the cluster of nodes is within the range of the set print size, printing the subview formed by the cluster of nodes; and

in response to the subview formed by the cluster of nodes exceeds the set print size,

re-clustering the cluster of nodes according to attribute information of the cluster of nodes to obtain clusters of next-level nodes, so that a subview formed by the cluster of nodes after the re-clustering is within the range of the set print size; and

printing the subview formed by the cluster of nodes after the re-clustering.

17. The non-transitory computer readable storage medium according to claim 16 , wherein the method further comprises:

in the subview formed by the cluster of nodes, scaling down regions corresponding to clusters of next-level nodes obtained by the re-clustering to obtain a subview formed by the cluster of nodes after the re-clustering; or

in the subview formed by the cluster of nodes, displaying each cluster of next-level nodes obtained by the re-clustering as a node to obtain a subview of the cluster of nodes after the re-clustering.

18. The non-transitory computer readable storage medium according to claim 16 , wherein the method further comprises:

printing subviews formed by the cluster of next-level nodes after the re-clustering.

19. The non-transitory computer readable storage medium according to claim 18 , wherein the method further comprises:

in response to the subview formed by the cluster of next-level nodes exceeding the set print size, re-clustering the cluster of next-level nodes according to attribute information of the cluster of next-level nodes to obtain clusters of further next-level nodes, so that a re-clustered subview formed by the cluster of next-level nodes after the re-clustering is within the range of the set print size.

20. The non-transitory computer readable storage medium according to claim 14 , wherein the subviews formed by the clustered nodes comprise:

subviews formed by clusters of nodes obtained by clustering, wherein a subview formed by a cluster of nodes is a maximal connected subgraph comprising this cluster of nodes.