Network Action Set
| Action Name | Description |
|---|---|
| biconnectedComponents | Calculates the biconnected components and articulation points of a graph |
| centrality | Calculates the centrality metrics of a graph |
| clique | Calculates the maximal cliques of a graph |
| community | Detects communities of a graph |
| connectedComponents | Calculates the connected components of a graph |
| core | Calculates the core decomposition of a graph |
| cycle | Calculates the cycles of a graph |
| loadGraph | Loads a graph into memory |
| nodeSimilarity | Calculates node similarity measures based on graph structure |
| path | Calculates the paths of a graph |
| patternMatch | Queries the graph for pattern matches |
| projection | Calculates the projection of multipartite network to yield a unipartite network |
| reach | Calculates the reach (ego network) of a graph |
| readGraph | Reads a graph |
| shortestPath | Calculates the shortest paths between pairs of nodes in a graph |
| summary | Calculates the summary statistics of a graph |
| transitiveClosure | Calculates the transitive closure of a graph |
| unloadGraph | Unloads a graph from memory |
Copyright © SAS Institute Inc. All rights reserved.
Last updated: November 04, 2020