将关系转换为矩阵 [英] Converting Relation to Matrix

问题描述

我有2套和1个关联.我想以矩阵形式显示它们.

I have 2 sets and 1 relation. I want to show them in a matrix.

char a[] = "12345";
char b[] = "ABCDE";
char r[] = "1C2B3E4D5A";

    int rel[LA][LA] = {
     /* A   B   C   D   E*/  
 /* 1*/{0,  0,  0,  0,  0} ,  
 /* 2*/{0,  0,  0,  0,  0} ,  
 /* 3*/{0,  0,  0,  0,  0} ,  
 /* 4*/{0,  0,  0,  0,  0} ,  
 /* 5*/{0,  0,  0,  0,  0}  };

在char数组中，每个char都是一个元素

in the char array each char is an element

char a[] = "12345";  is A{1,2,3,4,5}
Relation char r[] = "1C2B3E4D5A"; is R= {(1,C),(2.B).... }

我的问题是如何在矩阵上显示它们，如果矩阵中R中的A和B存在关系，则该点为1.

My question is how can I Show them on Matrix that If there is a relation on A and B in R in the matrix this point get 1 .

输出必须这样:

int rel[LA][LA] = {
     /* A   B   C   D   E*/  
 /* 1*/{0,  0,  1,  0,  0} ,  
 /* 2*/{0,  1,  0,  0,  0} ,  
 /* 3*/{0,  0,  0,  0,  1} ,  
 /* 4*/{0,  0,  0,  1,  0} ,  
 /* 5*/{1,  0,  0,  0,  0}  };

首先我尝试了:

for(i=0;i<LR-1;i=i+2){  // Look at element from A
for(j=0;j<LA;j++){         // Look at A
    if(r[i]==a[j]){   
       for(k=1;k<LR;k=k+2){ // Look at element from B
         for(m=0;m<LA;m++){  // Look at B
            if(r[k]==b[m]){
                rel[j][m]=1;   // if both exist that point gets 1
            }
         }
       }
    }
     }
  }

它不起作用.

推荐答案

以下是您的问题的解决方案:

Here is a solution to your problem:

public static void main(String[] args) {
    char[] a = "12345".toCharArray();
    char[] b = "ABCDE".toCharArray();
    char[] r = "1C2B3E4D5A".toCharArray();
    int LA=a.length;
    int LB=b.length;
    int LR=r.length;
    int[][] rel=new int[LA][LB];
    for(int i=0;i<LR;i+=2){
        int indexa=index(a,r[i]);
        int indexb=index(b,r[i+1]);
        rel[indexa][indexb]=1;

    }
    // Print out the matrix
    for(int i=0;i<LA;i++){
        for(int j=0;j<LB;j++){
            System.out.print(rel[i][j]);
        }
        System.out.println("");
    }

}
/**
 * Return the position of a value v array arr
 */
public static int index(char[] arr,char v){
    for(int i=0;i<arr.length;i++){
        if(arr[i]==v){
            return i;
        }
    }
    return -1;
}

这篇关于将关系转换为矩阵的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！