The efficiency module

Distance Measures class.

class hcga.features.efficiency.Efficiency(graph=None)

EFficiency Measures class.

Features based on the efficiency of a gaph. The efficiency of a pair of nodes is the multiplicative inverse of the shortest path distance between the nodes 1. Returns 0 if no path between nodes.

Uses networkx: Efficiency Measures

References

1

Latora, Vito, and Massimo Marchiori. “Efficient behavior of small-world networks.” Physical Review Letters 87.19 (2001): 198701. <https://doi.org/10.1103/PhysRevLett.87.198701>

Initialise a feature class.

Parameters

graph (Graph) – graph for initialisation, converted to given encoding

compute_features()

Main feature extraction function.

This function should be used by each specific feature class to add new features.