实验六 图及图的操作.doc

实验报告六 图及图的操作实验 实验目的： 1、掌握图的基本概念和术语 2、掌握图的存储结构及创建算法。1）邻接矩阵存储结构类定义： 自定义如下： public interface LListT { boolean isEmpty(); int length(); T get(int i); void set(int i,T x); void insert(int i,T x); void append(T x); T remove(int i); void removeAll(); } public class SeqListT implements LListT { private Object[] element; private int len; public SeqList(int size){ this.element=new Object[size]; this.len = 0; } public SeqList(SeqListT list){ this(list.len); this.len=list.len; } public SeqList(){ this(64); } public boolean isEmpty(){ return this.len==0; } public int length(){ return this.len; } public T get(int i){ if(i=0ithis.len) return (T)this.element[i]; return null; } public void set(int i, T x){ if(x==null) return; if(i=0ithis.len) this.element[i] = x; else throw new IndexOutOfBoundsException(i+); } public String toString(){ String str = (; if(this.len0) str += this.element[0].toString(); for(int i=1;ithis.len;i++) str +=,+this.element[i].toString(); return str+); } public void insert(int i, T x){ if(x==null) return; if(this.len==element.length){ Object[] temp = this.element; this.element=new Object[temp.length*2]; for(int j=0;j temp.length;i++) this.element[j]=temp[j]; } if(i0) i=0; if(ithis.len) i=this.len; for(int j=this.len-1;j=i;j--) this.element[j+1] = this.element[j]; this.element[i]=x; this.len++; } public void append(T x){ insert(this.len,x); } public T remove(int i){ if(this.len==0||i0||i=len) return null; T old = (T)this.element[i]; for(int j=0;jthis.len-1;j++) this.element[j] = this.element[j+1]; this.element[this.len-1]=null; this.len--; return old; } public void removeAll(){ this.len=0; } } （2） public class MatrixGraphT { protected SeqListT vertexlist; protected int[][] adjmatrix; private final int Max=0; public MatrixGraph(int size){ size=size10?10:size; this.vertexlist=new SeqLis