_get_densest(A, eligibleRows)

Parameters

A : 2-D array

An array representing a matrix

eligibleRows : 1-D logical array

Values indicate whether the corresponding row of A is eligible to be considered

Returns

i_densest : int

Index of the densest row in A eligible for consideration

Returns the index of the densest row of A. Ignores rows that are not eligible for consideration.

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/optimize/_remove_redundancy.py#35
type: <class 'function'>
Commit: