**1.4k**wrote:

The `connectedComp`

function determines a list of *vertices* that belong to a connected component. Is there a quick way to determine the non-redundant *edges* (i.e. not both A ⇔ B and B ⇔ A but one of these) in each connected component so that correlations (e.g. between pairs of protein measurements) may efficiently be calculated?

**13k**• written 11 months ago by Dario Strbenac •

**1.4k**

Hi Dario,

Maybe you can explain the problem to me a little more.

I'm trying to follow the example in the connectedComp help page. This is the graph the example mentions `

When I take a look at the

`edges()`

in the graph`km`

, I only see the non redundant connections.Only the list produced by the

`edges(ugraph(km))`

function gives me redudant information. Am i understanding you question correctly?140That's right.

1.4k