Splits the adjacency matrix of a loopless mixed graph into three components:
directed, undirected and bi-directed.
Usage
unmakeMG(amat)
Arguments
amat
a square matrix, with dimnames, representing a
loopless mixed graph. The matrix consists of 4 different integers as
an $ij$-element: 0 for a missing
edge between $i$ and $j$, 1 for an arrow from $i$ to $j$, 10 for a full line between
$i$ and $j$, a
Value
It is the inverse of makeAG. It returns the following
components.
dgthe adjacency matrix of the directed edges.
ugthe adjacency matrix of the undirected edges.
bgthe adjacency matrix of the bi-directed edges.
Details
The matrices ug, and bg are just symmetric Boolean
matrices.