图的最大流-通用推送标签方法

关注

原创最新推荐文章于 2026-04-19 12:38:18 发布 822 阅读 AI 写同款· GEO 优化 ›

MethodInvoker和Invoker using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading; using System.Windows 阅读详情

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

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

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

第二个视频发布 https://edu.youkuaiyun.com/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.youkuaiyun.com/course/detail/27574

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

package com.data.struct;


public class GenericPushRelabel {
	private Node[][]graphic;
	private Node s;
	private Node t;
	public GenericPushRelabel(){
		graphic=new Node[6][6];
		Node node0=new Node();
		node0.start=0;
		node0.end=0;
		graphic[0][0]=node0;
		Node node1=new Node();
		node1.start=1;
		node1.end=1;
		graphic[1][1]=node1;
		Node node2=new Node();
		node2.start=2;
		node2.end=2;
		graphic[2][2]=node2;
		Node node3=new Node();
		node3.start=3;
		node3.end=3;
		graphic[3][3]=node3;
		Node node4=new Node();
		node4.start=4;
		node4.end=4;
		graphic[4][4]=node4;
		Node node5=new Node();
		node5.start=5;
		node5.end=5;
		graphic[5][5]=node5;
		Node node01=new Node();
		node01.c=16;
		node01.start=0;
		node01.end=1;
		graphic[0][1]=node01;
		Node node10=new Node();
		node10.start=1;
		node10.end=0;
		node10.reverse=true;
		graphic[1][0]=node10;
		Node node02=new Node();
		node02.c=13;
		node02.start=0;
		node02.end=2;
		graphic[0][2]=node02;
		Node node20=new Node();
		node20.start=2;
		node20.end=0;
		node20.reverse=true;
		graphic[2][0]=node20;
		Node node13=new Node();
		node13.c=12;
		node13.start=1;
		node13.end=3;
		graphic[1][3]=node13;
		Node node31=new Node();
		node31.start=3;
		node31.end=1;
		node31.reverse=true;
		graphic[3][1]=node31;
		Node node21=new Node();
		node21.c=4;
		node21.start=2;
		node21.end=1;
		graphic[2][1]=node21;
		Node node12=new Node();
		node12.start=1;
		node12.end=2;
		node12.reverse=true;
		graphic[1][2]=node12;
		Node node24=new Node();
		node24.start=2;
		node24.end=4;
		node24.c=14;
		graphic[2][4]=node24;
		Node node42=new Node();
		node42.start=4;
		node42.end=2;
		node42.reverse=true;
		graphic[4][2]=node42;
		Node node32=new Node();
		node32.c=9;
		node32.start=3;
		node32.end=2;
		graphic[3][2]=node32;
		Node node23=new Node();
		node23.start=2;
		node23.end=3;
		node23.reverse=true;
		graphic[2][3]=node23;
		Node node35=new Node();
		node35.c=20;
		node35.start=3;
		node35.end=5;
		graphic[3][5]=node35;
		Node node53=new Node();
		node53.start=5;
		node53.end=3;
		node53.reverse=true;
		graphic[5][3]=node53;
		Node node43=new Node();
		node43.c=7;
		node43.start=4;
		node43.end=3;
		graphic[4][3]=node43;
		Node node34=new Node();
		node34.start=3;
		node34.end=4;
		node34.reverse=true;
		graphic[3][4]=node34;
		Node node45=new Node();
		node45.c=4;
		node45.start=4;
		node45.end=5;
		graphic[4][5]=node45;
		Node node54=new Node();
		node54.start=5;
		node54.end=4;
		node54.reverse=true;
		graphic[5][4]=node54;
		
		s=graphic[0][0];
		t=graphic[5][5];
	}
	
	public void genericPushRelabel(){
		initializePreflow();
		int i=1;
		while(true){
			boolean result=isRelabel();
			if(!result){
				break;
			}
			
		}
	}
	
	public boolean isPush(){
		boolean result=false;
		for(int i=1;i<graphic.length;i++){
			for(int j=1;j<graphic.length;j++){
				if(i!=j){
					if(graphic[i][i].h==graphic[j][j].h+1&&graphic[i][i].e>0&&graphic[i][j]!=null&&(graphic[i][j].c-graphic[i][j].f)>0){
						if(push(graphic[i][i],graphic[j][j])){
							result=true;
						}
					}
				}
			}
		}
		return result;
	}
	
	public boolean push(Node u,Node v){
		Node uv=graphic[u.start][v.start];
		int delta=Math.min(u.e, uv.c-uv.f);
		if(!uv.reverse){
			uv.f=uv.f+delta;
		}else{
			uv.f=uv.f-delta;
		}
		System.out.println("["+uv.start+","+uv.end+"]:"+delta);
		u.e=u.e-delta;
		v.e=v.e+delta;
		if(delta!=0){
			return true;
		}else{
			return false;
		}
		
	}
	
	public boolean isRelabel(){
		boolean result=false;
		for(int i=1;i<graphic.length;i++){
			for(int j=1;j<graphic.length;j++){
				if(i!=j){
					if(graphic[i][i].e>0&&graphic[i][i].h<=graphic[j][j].h&&graphic[i][j]!=null){
						boolean b=relabel(graphic[i][i]);
						if(b){
							result=b;
						}
					}
				}
			}
		}
		return result;
	}
	public boolean relabel(Node u){
		int h=Integer.MAX_VALUE;
		for(int i=0;i<graphic.length;i++){
			if(u.start!=i&&graphic[u.start][i]!=null){
				if(graphic[u.start][i].c-graphic[u.start][i].f>0){
					h=Math.min(h, graphic[i][i].h);
				}
			}
		}
		if(h==Integer.MAX_VALUE){
			return true;
		}
		if(u.h==1+h){
			return false;
		}
		u.h=1+h;
		printH();
		while(isPush()){
			printF();
			printE();
		}
		return true;
	}
	public void initializePreflow(){
		s.h=graphic.length;
		for(int i=0;i<graphic.length;i++){
			if(i!=s.start&&graphic[s.start][i]!=null){
				graphic[s.start][i].f=graphic[s.start][i].c;
				graphic[i][i].e=graphic[s.start][i].c;
				s.e=s.e-graphic[s.start][i].c;
			}
		}
	}
	public void printE(){
		System.out.println("E:");
		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].e+" ");
				}else{
					System.out.print("  ");
				}
			}
			System.out.println();
		}
	}
	public void printF(){
		System.out.println("F:");
		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].f+" ");
				}else{
					System.out.print("  ");
				}
			}
			System.out.println();
		}
	}
	public void printH(){
		System.out.println("H:");
		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].h+" ");
				}else{
					System.out.print("  ");
				}
			}
			System.out.println();
		}
	}
	public void printResult(){
		int result=0;
		for(int i=0;i<graphic.length;i++){
			if(graphic[t.start][i]!=null){
				result+=graphic[i][t.start].f;
			}
		}
		System.out.println("max flow:"+result);
	}
	public void print(){
		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].c+" ");
				}else{
					System.out.print("  ");
				}
			}
			System.out.println();
		}
	}
	private class Node{
		private int c;
		private int f;
		private int start;
		private int end;
		private boolean reverse;
		private int e;
		private int h;
	}
	public static void main(String[] args) {
		GenericPushRelabel g=new GenericPushRelabel();
		g.print();
		g.genericPushRelabel();
		g.printResult();

	}

}

收录于