Sometimes we need to turn a directed network into an undirected one. Thi=
s operation is called *symmetrize*. There are many ways to symmetriz=
e, specially if you have a weighted network. Here we present the most simpl=
e ones

- =20
**Treat graph as a matrix (instead of an edgelist)**will = be treated as zero or the empty string. Any edges set to entirely zero or t= he empty string will be removed. =20
**Symmetrize by Maximum (max)**When you symmetrize by max= imum you consider each edge and replace its value for the direction which i= s higher. For example, let us say that the edge (Mark,Peter) has a value of= 3 and (Peter,Mark) has a value of 2. Here you will replace both these edge= s by an undirected edge with a value of 3. In the case of a simple graph (n= o weights) the algorithm turns every directed edge into an undirected one.<= /li>=20**Symmetrize by Minimum (min)**When you symmetrize by min= imum you consider each edge and replace its value for the direction which i= s lower. For example, let us say that the edge (Mark,Peter) has a value of = 3 and (Peter,Mark) has a value of 2. Here you will replace both these edges= by an undirected edge with a value of 2. In the case of a simple graph (no= weights) the algorithm removes all unreciprocal links (removes all links t= hat go only in one direction). =20

- =20
- Source Code =20

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.