@graphty/algorithms / index / EigenvectorCentralityOptions

Interface: EigenvectorCentralityOptions

Defined in: algorithms/centrality/eigenvector.ts:15

Eigenvector centrality implementation

Measures the influence of a node based on the influence of its neighbors. A node has high eigenvector centrality if it is connected to nodes that themselves have high eigenvector centrality.

Time complexity: O(V + E) per iteration Space complexity: O(V)

Extends

• CentralityOptions

Properties

endpoints?

optional endpoints: boolean

Defined in: types/index.ts:92

Inherited from

CentralityOptions.endpoints

---

maxIterations?

optional maxIterations: number

Defined in: algorithms/centrality/eigenvector.ts:16

---

mode?

optional mode: "in" | "out" | "total"

Defined in: types/index.ts:93

Inherited from

CentralityOptions.mode

---

normalized?

optional normalized: boolean

Defined in: types/index.ts:91

Inherited from

CentralityOptions.normalized

---

startVector?

optional startVector: Map<string, number>

Defined in: algorithms/centrality/eigenvector.ts:18

---

tolerance?

optional tolerance: number

Defined in: algorithms/centrality/eigenvector.ts:17