所有节点对最短路径-Floyd-Warshall算法

发布一个k8s部署视频：https://edu.csdn.net/course/detail/26967

课程内容：各种k8s部署方式。包括minikube部署，kubeadm部署，kubeasz部署，rancher部署，k3s部署。包括开发测试环境部署k8s，和生产环境部署k8s。

腾讯课堂连接地址https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518

第二个视频发布  https://edu.csdn.net/course/detail/27109

腾讯课堂连接地址https://ke.qq.com/course/484107?tuin=ba64518

介绍主要的k8s资源的使用配置和命令。包括configmap，pod，service，replicaset，namespace，deployment，daemonset，ingress，pv，pvc，sc，role，rolebinding，clusterrole，clusterrolebinding，secret，serviceaccount，statefulset，job，cronjob，podDisruptionbudget，podSecurityPolicy,networkPolicy,resourceQuota，limitrange，endpoint，event，conponentstatus，node，apiservice，controllerRevision等。

第三个视频发布：https://edu.csdn.net/course/detail/27574

详细介绍helm命令，学习helm chart语法，编写helm chart。深入分析各项目源码，学习编写helm插件
————————————————------------------------------------------------------------------------------------------------------------------

 

package com.data.struct;

import java.util.Random;

public class FloydWarshall {
	private Node [][]graphic;
	public FloydWarshall(int v,int e){
		graphic=new Node[v][v];
		for(int i=0;i<e;i++){
			int v1=new Random().nextInt(v);
			int v2=new Random().nextInt(v);
			Node node=new Node();
			node.w=new Random().nextInt(v)+1;
			node.start=v1;
			node.end=v2;
			graphic[v1][v2]=node;
		}
		for(int i=0;i<v;i++){
			if(graphic[i][i]==null){
				Node node=new Node();
				node.w=0;
				node.start=i;
				node.end=i;
				graphic[i][i]=node;
			}else{
				graphic[i][i].w=0;
			}
		}
		
	}
	
	public Node[][] floydWarshall(){
		Node [][][]f=new Node[graphic.length][graphic.length][graphic.length];
		f[0]=graphic;
		for(int k=1;k<graphic.length;k++){
			f[k]=new Node[graphic.length][graphic.length];
			for(int i=0;i<graphic.length;i++){
				for(int j=0;j<graphic.length;j++){
					Node node=new Node();
					node.w=Integer.MAX_VALUE;
					node.start=i;
					node.end=j;
					if(f[k-1][i][j]!=null&&f[k-1][i][k]!=null&&f[k-1][k][j]!=null){
						node.w=Math.min(f[k-1][i][j].w, f[k-1][i][k].w+f[k-1][k][j].w);
					}else if(f[k-1][i][j]!=null&&(f[k-1][i][k]==null||f[k-1][k][j]==null)){
						node.w=f[k-1][i][j].w;
					}else if(f[k-1][i][j]==null&&f[k-1][i][k]!=null&&f[k-1][k][j]!=null){
						node.w=f[k-1][i][k].w+f[k-1][k][j].w;
					}else {
						node=null;
					}
					f[k][i][j]=node;
				}
			}
		}
		return f[graphic.length-1];
	}
	public void print(){
		System.out.println("origranal:");
		for(int i=0;i<graphic.length;i++){
			for(int j=0;j<graphic.length;j++){
				if(graphic[i][j]!=null){
					System.out.print(graphic[i][j].w+" ");
				}else{
					System.out.print(" "+" ");
				}
			}
			System.out.println();
		}
		
		Node [][] l=floydWarshall();
		System.out.println("result:");
		for(int i=0;i<l.length;i++){
			for(int j=0;j<l.length;j++){
				if(l[i][j]!=null){
					System.out.print(l[i][j].w+" ");
				}else{
					System.out.print(" "+" ");
				}
			}
			System.out.println();
		}
	}
	
	private class Node{
		private int w;
		private int start;
		private int end;
	}
	public static void main(String[] args) {
		FloydWarshall f=new FloydWarshall(5,20);
		f.print();

	}

}

路径打印：

package com.data.struct; import java.util.Iterator; import java.util.Random; import java.util.TreeSet; public class FloydWarshall { private Node [][]graphic; private Node [][][]f; private TreeSet<Integer>[][] paths; public FloydWarshall(int v,int e){ graphic=new Node[v][v]; for(int i=0;i<e;i++){ int v1=new Random().nextInt(v); int v2=new Random().nextInt(v); Node node=new Node(); node.w=new Random().nextInt(v)+1; node.start=v1; node.end=v2; graphic[v1][v2]=node; } for(int i=0;i<v;i++){ if(graphic[i][i]==null){ Node node=new Node(); node.w=0; node.start=i; node.end=i; graphic[i][i]=node; }else{ graphic[i][i].w=0; } } f=new Node[graphic.length][graphic.length][graphic.length]; paths=new TreeSet[graphic.length][graphic.length]; } public Node[][] floydWarshall(){ //Node [][][]f=new Node[graphic.length][graphic.length][graphic.length]; f[0]=graphic; for(int k=1;k<graphic.length;k++){ f[k]=new Node[graphic.length][graphic.length]; for(int i=0;i<graphic.length;i++){ for(int j=0;j<graphic.length;j++){ Node node=new Node(); node.w=Integer.MAX_VALUE; node.start=i; node.end=j; if(f[k-1][i][j]!=null&&f[k-1][i][k]!=null&&f[k-1][k][j]!=null){ if(f[k-1][i][j].w< f[k-1][i][k].w+f[k-1][k][j].w){ node.w=f[k-1][i][j].w; node.parent=f[k-1][i][j]; }else{ node.w= f[k-1][i][k].w+f[k-1][k][j].w; node.parent=f[k-1][k][j]; } }else if(f[k-1][i][j]!=null&&(f[k-1][i][k]==null||f[k-1][k][j]==null)){ node.w=f[k-1][i][j].w; node.parent=f[k-1][i][j]; }else if(f[k-1][i][j]==null&&f[k-1][i][k]!=null&&f[k-1][k][j]!=null){ node.w=f[k-1][i][k].w+f[k-1][k][j].w; node.parent=f[k-1][k][j]; }else { node=null; } f[k][i][j]=node; } } } return f[graphic.length-1]; } public void pirntPath(){ for(int i=0;i<f[graphic.length-1].length;i++){ for(int j=0;j<f[graphic.length-1][i].length;j++){ if(f[graphic.length-1][i][j]!=null&&i!=j){ System.out.print("("+f[graphic.length-1][i][j].start+","+f[graphic.length-1][i][j].end+")"+":"+f[graphic.length-1][i][j].start+"->"); TreeSet<Integer> path=new TreeSet<Integer>(); path.add(f[graphic.length-1][i][j].start); paths[i][j]=path; Node p=f[graphic.length-1][i][j].parent; Node node=f[graphic.length-1][i][j]; int lever=graphic.length-3; if(p!=null){ if(p.parent==null){ System.out.print("("+node.start+","+p.start+")"+"=>"); }else{ recuisivePrintPath(p,lever,i,j); } } if(!path.contains(f[graphic.length-1][i][j].end)){ System.out.print(f[graphic.length-1][i][j].end); } System.out.println(); } } } } public void recuisivePrintPath(Node node,int level,int i,int j){ Node p=node.parent; TreeSet<Integer>path= paths[i][j]; if(f[level][node.start][p.start].parent!=null){ recuisivePrintPath(f[level][node.start][p.start],level-1,i,j); if(node.start!=p.start){ if(!path.contains(p.start)){ path.add(p.start); System.out.print(p.start+"->"); } } }else{ if(node.start!=p.start&&p.start!=p.end){ if(!path.contains(p.start)){ path.add(p.start); System.out.print(p.start+"->"); } } } Node n=f[level][p.start][p.end]; if(n.parent!=null&&n.parent.start!=n.parent.end){ recuisivePrintPath(n,level-1,i,j); } } public void print(){ System.out.println("origranal:"); for(int i=0;i<graphic.length;i++){ for(int j=0;j<graphic.length;j++){ if(graphic[i][j]!=null){ System.out.print(graphic[i][j].w+" "); }else{ System.out.print(" "+" "); } } System.out.println(); } Node [][] l=floydWarshall(); System.out.println("result:"); for(int i=0;i<l.length;i++){ for(int j=0;j<l.length;j++){ if(l[i][j]!=null){ System.out.print(l[i][j].w+" "); }else{ System.out.print(" "+" "); } } System.out.println(); } } private class Node{ private int w; private int start; private int end; private Node parent; } public static void main(String[] args) { FloydWarshall f=new FloydWarshall(5,20); f.print(); f.pirntPath(); } }