如何将邻接矩阵转换为发生率矩阵，反之亦然？(How do you transform Adjacency matrices to Incidence matrices and vice-versa?)

 我们假设矩阵如下：（N = 4） 
 
 邻接： 
 
 0110 1001 1001 0110 
 
 发病率： 
 
 1100 1010 0101 0011 
 
 你怎么能得到Incidence矩阵只有邻接矩阵，反之亦然？ 
 
 PS：我从一个.txt文件得到的邻接矩阵，我已经读入一个数组并通过以下算法得到它： 
 
int read(){

    ifstream graf("graf.txt");
    if(graf.is_open()){
        graf >> n;
        for (int i=0; i < n; i++) {
        for(int j = 0; j<2; j++)
                graf >> Graf[i][j];
        }
    }
    graf.close();
    return 0;
}

void adj() {
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
        sz[i][j] = 0;
    for (int i=0; i<n; i++)
        for (int j=0; j<2; j++)
        {sz[Graf[i][j]-1][Graf[i][j+1]-1] = 1;}
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
        sz[j][i] = sz[i][j];
}

Let's say the matrices are the following: (N = 4)
 
Adjacency:
 
0110 1001 1001 0110
 
Incidence:
 
1100 1010 0101 0011
 
How can you get the Incidence matrix from having just the Adjacency one, and vice-versa?
 
P.S: The Adjacency Matrix I'm getting from a .txt document, which I've read into an array and got it by the following algorithm: 
 
int read(){

    ifstream graf("graf.txt");
    if(graf.is_open()){
        graf >> n;
        for (int i=0; i < n; i++) {
        for(int j = 0; j<2; j++)
                graf >> Graf[i][j];
        }
    }
    graf.close();
    return 0;
}

void adj() {
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
        sz[i][j] = 0;
    for (int i=0; i<n; i++)
        for (int j=0; j<2; j++)
        {sz[Graf[i][j]-1][Graf[i][j+1]-1] = 1;}
    for (int i=0; i<n; i++)
        for (int j=0; j<n; j++)
        sz[j][i] = sz[i][j];
}

原文：https://stackoverflow.com/questions/22380139