Connection Nature Between Nodes in Graph Structure

1. A computing system comprising: one or more processors; and one or more hardware storage devices that store instructions that are executable by the one or more processors to cause the computing system to: determine a first path between a set of nodes, which includes a first terminal node, a second terminal node, and a first intermediary node; determine a first detour path between the first terminal node and the second terminal node, wherein the first detour path (i) routes from the first terminal node along the first path up to the first intermediary node, (ii) routes around the first intermediary node via use of a second intermediary node such that the first detour path omits the first intermediary node, and (iii) uses a first shortest path from the second intermediary node to the second terminal node; determine a second detour path between the first terminal node and the second terminal node, wherein the second detour path, which also omits the first intermediary node, is a second shortest path from the first terminal node to the second terminal node; determine a first number of network hops in the first path, a second number of network hops in the first detour path, and a third number of network hops in the second detour path; determine a difference between (i) the first number of network hops and (ii) a combination of the second and third numbers of network hops; and assign a significance score to the first intermediary node based on the determined difference.

2. The computing system of claim 1, wherein a visualization size of one of the first or second intermediary nodes is modified based on the significance score.

3. The computing system of claim 1, wherein a third intermediary node is included in the first path and at least one of the first or second detour paths.

4. The computing system of claim 1, wherein the difference is zero hops.

5. The computing system of claim 1, wherein the first path is a shortest path between the first and second terminal nodes.

6. The computing system of claim 1, wherein the difference is at least one hop.

7. The computing system of claim 1, wherein a relatively higher value for the significance score indicates the difference is a relatively larger difference, and wherein a relatively lower value for the significance score indicates the difference is a relatively smaller difference.

8. The computing system of claim 1, wherein a visualization thickness of one or more intermediary edges is modified based on the significance score.

9. The computing system of claim 1, wherein, while the first path is being evaluated, edges in the first path are visually emphasized.

10. A method comprising: determining a first path between a set of nodes, which includes a first terminal node, a second terminal node, and a first intermediary node; determining a first detour path between the first terminal node and the second terminal node, wherein the first detour path (i) routes from the first terminal node along the first path up to the first intermediary node, (ii) routes around the first intermediary node via use of a second intermediary node such that the first detour path omits the first intermediary node, and (iii) uses a first shortest path from the second intermediary node to the second terminal node; determining a second detour path between the first terminal node and the second terminal node, wherein the second detour path, which also omits the first intermediary node, is a second shortest path from the first terminal node to the second terminal node; determining a first number of network hops in the first path, a second number of network hops in the first detour path, and a third number of network hops in the second detour path; determining a difference between (i) the first number of network hops and (ii) a combination of the second and third numbers of network hops; and assigning a significance score to the first intermediary node based on the determined difference.

11. The method of claim 10, wherein the set of nodes are included in a graph data structure.

12. The method of claim 11, wherein a visualization size of the first intermediary node in the graph data structure is either increased or decreased.

13. The method of claim 11, wherein a visualization size of the second intermediary node in the graph data structure is either increased or decreased.

14. The method of claim 11, wherein visualization sizes of both the first intermediary node and the second intermediary node in the graph data structure are either increased or decreased.

15. A computer system comprising: one or more processors; and one or more hardware storage devices that store instructions that are executable by the one or more processors to cause the computer system to: determine a first path between a set of nodes, which includes a first terminal node, a second terminal node, and a first intermediary node; determine a first detour path between the first terminal node and the second terminal node, wherein the first detour path (i) routes from the first terminal node along the first path up to the first intermediary node, (ii) routes around the first intermediary node via use of a second intermediary node such that the first detour path omits the first intermediary node, and (iii) uses a first shortest path from the second intermediary node to the second terminal node; determine a second detour path between the first terminal node and the second terminal node, wherein the second detour path, which also omits the first intermediary node, is a second shortest path from the first terminal node to the second terminal node; determine a first number of network hops in the first path, a second number of network hops in the first detour path, and a third number of network hops in the second detour path; determine a difference between (i) the number of network hops and (ii) a combination of the second and third numbers of network hops; assign a significance score to the first intermediary node based on the determined difference; and modify a visualization size of at least one of the first intermediary node or the second intermediary node in a graph data structure.

16. The computer system of claim 15, wherein a third intermediary node is included in the first path.

17. The computer system of claim 15, wherein a third intermediary node is included in the first or second detour paths.

18. The computer system of claim 15, wherein the difference is zero hops.

19. The computer system of claim 15, wherein the difference is one or more hops.