component.java

来自「Java实现的图的强连通分支算法」· Java 代码 · 共 32 行

import java.util.*;

public class Component {    // 强连通分量类
	private LinkedList<Integer> group = new LinkedList<Integer>();
	public int getsize() { return group.size(); }
	
	public void add(int id) {    // 加法函数
		if(group.isEmpty()) group.add(id);
		else {
			for(int i = 0; i < group.size(); i++) {
				if(i == (group.size() - 1) && id > group.get(i)) {
					group.add(id);
					break;
				} else if(id < group.get(i)) {
					group.add(i, id);
					break;
				}
			}
		}
	}
	
	public String write() {    // 写入函数
		String result = "(";
		for(int j = 0; j < group.size(); j++) {
			result = result + group.get(j);
			if(j != group.size() - 1) result = result + ",";
		}
		result = result + ")";
		return result;
	}
}