...

**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 the empty string will be removed.**Symmetrize by Maximum (max)**When you symmetrize by maximum you consider each edge and replace its value for the direction which is 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 edges by an undirected edge with a value of 3. In the case of a simple graph (no weights) the algorithm turns every directed edge into an undirected one.**Symmetrize by Minimum (min)**When you symmetrize by minimum you consider each edge and replace its value for the direction which is 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 that go only in one direction).

**Links**

**See Also**

{:spaces=}
{incoming-links}Wiki Markup | ||
---|---|---|

Incoming Links | ||

| ||