图 :包含了多组 从一个顶点到另一个顶点的连接数据
图就需要记录对应的顶点数据,即顶点在实际应用的的数据
图就需要记录每个顶点互相之间的连通数据
图就需要记录总共可以走通的路的条数
code
namespace DataStructure {
export class MapGrap{
private edges: number[][]; // 边对应的数据
private vertexs : string[]; // 顶点数据
private numberOfEdges : number; // 总共的边数
constructor(vertex:number){
this.vertexs = new Array<string>();
this.vertexs.length = vertex;
this.edges = new Array<Array<number>>(vertex);
for (let i = 0; i < this.edges.length; i++) {
this.edges[i] = new Array<number>(vertex);
for (let j = 0; j < this.edges[i].length; j++) {
this.edges[i][j] = 0; // 初始化权值都是 0
}
}
this.numberOfEdges = 0;
}
public getEdgesWeight(v1:number, v2:number) : number{
return this.edges[v1][v2];
}
public printMap() :void{
console.log("地图打印: -------------------------------");
console.table(this.edges);
for (const rows of this.edges) {
}
}
/**
* 添加顶点
* @param vertex 顶点字符串
*/
public addVertex(vertex: string) : void{
this.vertexs.push(vertex);
}
/**
* 插入一条边
* @param v1 顶点一
* @param v2 顶点二
* @param weight 权重 或者 你需要的边长路径之类的
*/
public insertEdge(v1:number, v2:number, weight:number) : void{
if(! this.edges[v1]){
this.edges[v1] = new Array<number>(this.getVertexLen());
}
if(! this.edges[v2]){
this.edges[v2] = new Array<number>(this.getVertexLen());
}
this.edges[v1][v2] = weight;
this.edges[v2][v1] = weight;
this.numberOfEdges ++;
}
public getVertexLen() : number{
return this.vertexs.length;
}
}
}