R: Querying node measures

node_measures {tidygraph} | R Documentation

## Querying node measures

### Description

These functions are a collection of node measures that do not really fall into the class of centrality measures. For lack of a better place they are collected under the `node_*` umbrella of functions.

### Usage

    node_eccentricity(mode = "out")

    node_constraint(weights = NULL)

    node_coreness(mode = "out")

    node_diversity(weights = NULL)

### Arguments

`mode` | The way edges should be followed in the case of directed graphs.
`weights` | The weights to use for each node during calculation

### Value

A numeric vector of the same length as the number of nodes in the graph.

### Functions

- `node_eccentricity`: measure the maximum shortest path to all other nodes in the graph

- `node_constraint`: measures Burts constraint of the node. See `igraph::constraint()`

- `node_coreness`: measures the coreness of each node. See `igraph::coreness()`

- `node_diversity`: measures the diversity of the node. See `igraph::diversity()`

### Examples

    # Calculate Burt's Constraint for each node
    create_notable('meredith') %>%
      mutate(b_constraint = node_constraint())

[Package tidygraph version 1.0.0 Index]