发布一个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 ConnectedComponent {
private Node[] list;
public ConnectedComponent(int v,int e){
list=new Node[v];
for(int i=0;i<v;i++){
Node node=new Node();
node.id=i;
list[i]=node;
}
for(int i=0;i<e;i++){
int v1=new Random().nextInt(v);
int v2=new Random().nextInt(v);
if(v1==v2){
continue;
}
while(true){
Node node=list[v1];
boolean already=false;
while(node.next!=null){
if(node.next.id==v2){
already=true;
break;
}
node=node.next;
}
if(already==true){
break;
}
Node ex=new Node();
ex.id=v2;
node.next=ex;
break;
}
}
for(int i=0;i<list.length;i++){
makeSet(list[i]);
}
for(int i=0;i<list.length;i++){
Node node=list[i];
Node w=node;
while(node.next!=null){
if(findSet(list[w.id])!=findSet(list[node.next.id])){
union(list[w.id],list[node.next.id]);
}
node=node.next;
}
}
}
public void makeSet(Node x){
x.parent=x;
x.rank=0;
}
public void union(Node x,Node y){
link(findSet(x),findSet(y));
}
private void link(Node x,Node y){
if(x.rank>y.rank){
y.parent=x;
}else{
x.parent=y;
if(x.rank==y.rank){
y.rank++;
}
}
}
public Node findSet(Node x){
if(x.parent!=x){
x.parent=findSet(x.parent);
}
return x.parent;
}
public boolean sameComponent(Node u,Node v){
if(findSet(u)==findSet(v)){
return true;
}else {
return false;
}
}
public static class Node{
private int id;
private Node next;
private Node parent;
private int rank;
}
public static void main(String[] args) {
ConnectedComponent c=new ConnectedComponent(10,5);
System.out.println(c.sameComponent(c.list[0], c.list[1]));
}
}