10. Algorithms
In this Session… | Before you begin… |
| To follow along, download: |
Slide | |
---|---|
1 | How To GraphXR 10. Algorithms |
2 | Before You Begin… Ideally, you’ll have worked through Module 9. Time Series. If you’re starting here, and you want to follow along, you’ll need to:
|
3 | Open the Algorithm panel. Graph algorithms help find and highlight paths, measure connectedness, and calculate measures of sub-grouping in large graph networks. to run a variety of commonly used graph algorithms against your data. |
4 | Algorithms are organized in Path Finding, Centrality, and Community Detection tabs. |
5 | Path Finding finds and selects the shortest path between two sets of nodes. Let’s select a few Episodes nodes and find the paths connecting them to selected House nodes. |
6 | Select starting Episode nodes and click Add to Start. |
7 | Select ending House nodes and click Add to End. Now click Trace Path.. |
6 | With a complicated graph it can be hard to see the path. You can click the Spotlight Path toggle to see only the nodes and edges involved in the path. |
7 | Click Un-spotlight Path to see the entire graph again. |
8 | The nodes and edges that make up the path are selected. To see only those nodes and edges click the Spotlight Path toggle. |
9 | You can Tag the spotlit path nodes, take a snapshot, or save a view. |
10 | To find a path between any two nodes, simply select the two nodes and in the right-click menu choose Find Path. |
11 | To isolate this selected path you can use the right-click menu Select=>Invert and then Actions=>Hide. Or, open the Algorithm=>Path Finding tab to spotlight the path. |
12 | A brief aside: the Trace Neighbor toolbar icon provides another way to explore paths from selected nodes (but not to a specified set of ending nodes). Select one or more nodes and click Trace Neighbor. |
13 | The slider control shows the number of hops in the graph. Choose the number of path hops to highlight (in this case, try 2). |
14 | To isolate the highlighted path, click the Select Visible icon, then click Inverse and Hide Selected to hide the data not on the highlighted path. |
15 | Centrality algorithms measure the impact of the nodes in a graph in various specific ways. Simply click to run, and a property and value for that algorithm will be added to every node in the graph. |
16 | Open an information window or a Table to see the new properties. To edit and export results, display an Enhanced Table or click Export Excel or Export CSV. |
17 | Community Detection algorithms are used to find strongly connected subgraphs (or clusters) in larger graphs. The commonly used Connected Component, Strong Connected Component, Louvain and Label Propagation algorithms are available. |
18 | Again, click to run. A corresponding property and value is added to every node in the graph. Open a table or an information widow to view the results. |
19 | For a detailed overview of how these algorithms work and how to use them appropriately, refer to https://neo4j.com/lp/book-graph-algorithms-ms/ . Next, in Module 11. Editing, we’ll delve into how to add and edit graph data. |
Next Steps…
How To GraphXR: Module 11. Editing.