java来构造关联矩阵

使用java来构造关联矩阵

程序如下

FileUtil.java

package com.gongjiao;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.List;

/**
 * 用来读取文件和保存文件
 * @author Administrator
 *
 */
public class FileUtil {

	// //读取文件
	public static ArrayList<String> getFile(String filename) {

		BufferedReader br = null;

		ArrayList<String> list = new ArrayList<String>();

		try {

			br = new BufferedReader(new InputStreamReader(new FileInputStream(
					new File(filename)), "GBK"));

			String str = br.readLine();

			while (str != null) {

				list.add(str);

				str = br.readLine();
			}

			br.close();

		} catch (Exception e) {

			e.printStackTrace();
		}
		return list;
	}

	// 保存文件
	public static void savefile(List<String> list, String filename) {

		BufferedWriter bout = null;
		try {
			bout = new BufferedWriter(new OutputStreamWriter(
					new FileOutputStream(filename), "GBK"));
			for (String str : list) {
				if (str != null && !str.equals("")) {
					bout.write(str);
					bout.newLine();
				}
			}
			bout.flush();
			bout.close();

		} catch (Exception e) {

			e.printStackTrace();
		}

	}

}

IncidenceMatrix.java

package com.supernetwork;

import java.util.ArrayList;

/**
 * 利用边和节点来构造关联矩阵
 * @author Administrator
 */
public class IncidenceMatrix
{
	public static void main(String[] args)
	{
		ArrayList<String> strList = new ArrayList<String>();
		
		//边
		ArrayList<String> edges = FileUtil.getFile("edge.txt");
		
		//节点
		ArrayList<String> nodes = FileUtil.getFile("node.txt");
		
		int[][] matrix = new int[nodes.size()][edges.size()];

		for (int i = 0; i < nodes.size(); i++)
		{
			for (int j = 0; j < edges.size(); j++)
			{
				matrix[i][j] = 0;
			}
		}
	
		for (int i = 0; i < nodes.size(); i++)
		{
			for (int j = 0; j < edges.size(); j++)
			{
				if (edges.get(j).contains(nodes.get(i)))
				{
					  matrix[i][j] = 1;
				}
				
			}
		}
		
		for (int i = 0; i < nodes.size(); i++)
		{
			StringBuffer sb = new StringBuffer();
		    
			if( i == 0 ){
				
				sb.append("[[");
			
			}else {
				
				sb.append("[");
			}

			for (int j = 0; j < nodes.size(); j++)
			{
				sb.append(matrix[i][j] + ",");
			}
			
			String str = sb.toString().substring(0,sb.toString().length() - 1);
			
			if( i == nodes.size() - 1){
				
				str = str + "]]";
			
			}else{
				
				str = str + "],";
			}
			strList.add(str);

		}
		
		FileUtil.savefile(strList,"incidenceMatrix.txt");
		
		System.out.println("成功!!");

	}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值