This function build a weighted undirected graph without loops from the matrix `B`

. The weights of the edges depend on squared partial correlations.

1 | ```
DESP_Weighted_Graph(B, n)
``` |

`B` |
The coefficient matrix. |

`n` |
The sample size. |

A new undirected graphNEL object.

Arnak Dalalyan and Samuel Balmand.

`sparseM2Graph`

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.