"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1246],{3905:(I,a,i)=>{i.d(a,{Zo:()=>g,kt:()=>b});vart=i(7294);functionm(I,a,i){returnainI?Object.defineProperty(I,a,{value:i,enumerable:!0,configurable:!0,writable:!0}):I[a]=i,I}functionn(I,a){vari=Object.keys(I);if(Object.getOwnPropertySymbols){vart=Object.getOwnPropertySymbols(I);a&&(t=t.filter((function(a){returnObject.getOwnPropertyDescriptor(I,a).enumerable}))),i.push.apply(i,t)}returni}functione(I){for(vara=1;a<arguments.length;a++){vari=null!=arguments[a]?arguments[a]:{};a%2?n(Object(i),!0).forEach((function(a){m(I,a,i[a])})):Object.getOwnPropertyDescriptors?Object.defineProperties(I,Object.getOwnPropertyDescriptors(i)):n(Object(i)).forEach((function(a){Object.defineProperty(I,a,Object.getOwnPropertyDescriptor(i,a))}))}returnI}functionl(I,a){if(null==I)return{};vari,t,m=function(I,a){if(null==I)return{};vari,t,m={},n=Object.keys(I);for(t=0;t<n.length;t++)i=n[t],a.indexOf(i)>=0||(m[i]=I[i]);returnm}(I,a);if(Object.getOwnPropertySymbols){varn=Object.getOwnPropertySymbols(I);for(t=0;t<n.length;t++)i=n[t],a.indexOf(i)>=0||Object.prototype.propertyIsEnumerable.call(I,i)&&(m[i]=I[i])}returnm}varN=t.createContext({}),s=function(I){vara=t.useContext(N),i=a;returnI&&(i="function"==typeofI?I(a):e(e({},a),I)),i},g=function(I){vara=s(I.components);returnt.createElement(N.Provider,{value:a},I.children)},Z="mdxType",c={inlineCode:"code",wrapper:function(I){vara=I.children;returnt.createElement(t.Fragment,{},a)}},G=t.forwardRef((function(I,a){vari=I.components,m=I.mdxType,n=I.originalType,N=I.parentName,g=l(I,["components","mdxType","originalType","parentName"]),Z=s(i),G=m,b=Z["".concat(N,".").concat(G)]||Z[G]||c[G]||n;returni?t.createElement(b,e(e({ref:a},g),{},{components:i})):t.createElement(b,e({ref:a},g))}));functionb(I,a){vari=arguments,m=a&&a.mdxType;if("string"==typeofI||m){varn=i.length,e=newArray(n);e[0]=G;varl={};for(varNina)hasOwnProperty.call(a,N)&&(l[N]=a[N]);l.originalType=I,l[Z]="string"==typeofI?I:m,e[1]=l;for(vars=2;s<n;s++)e[s]=i[s];returnt.createElement.apply(null,e)}returnt.createElement.apply(null,i)}G.displayName="MDXCreateElement"},3903:(I,a,i)=>{i.r(a),i.d(a,{assets:()=>N,contentTitle:()=>e,default:()=>c,frontMatter:()=>n,metadata:()=>l,toc:()=>s});vart=i(7462),m=(i(7294),i(3905));constn={id:"bfs-tree",title:"Distance boundaries from BFS tree on undirected graphs",description:"Short explanation of distance boundaries deduced from a BFS tree.\n",tags:["graphs","bfs"],last_update:{date:newDate("2022-04-30T00:00:00.000Z")}},e=void0,l={unversionedId:"graphs/bfs-tree",id:"graphs/bfs-tree",title:"Distance boundaries from BFS tree on undirected graphs",description:"Short explanation of distance boundaries deduced from a BFS tree.\n",source:"@site/ib002/10-graphs/2022-04-30-bfs-tree.md",sourceDirName:"10-graphs",slug:"/graphs/bfs-tree",permalink:"/ib002/graphs/bfs-tree",draft:!1,editUrl:"https://github.com/mfocko/blog/tree/main/ib002/10-graphs/2022-04-30-bfs-tree.md",tags:[{label:"graphs",permalink:"/ib002/tags/graphs"},{label:"bfs",permalink:"/ib002/tags/bfs"}],version:"current",lastUpdatedAt:1651276800,formattedLastUpdatedAt:"Apr 30, 2022",frontMatter:{id:"bfs-tree",title:"Distance boundaries from BFS tree on undirected graphs",description:"Short explanation of distance boundaries deduced from a BFS tree.\n",tags:["graphs","bfs"],last_update:{date:"2022-04-30T00:00:00.000Z"}},sidebar:"autogeneratedBar",previous:{title:"Iterative algorithms via iterators",permalink:"/ib002/graphs/iterative-and-iterators"}},N={},s=[{value:"Introduction",id:"introduction",level:2},{value:"Lower bound",id:"lower-bound",level:2},{value:"Proof by contradiction",id:"proof-by-contradiction",level:2}],g={toc:s},Z="wrapper";functionc(I){let{components:a,...n}=I;return(0,m.kt)(Z,(0,t.Z)({},g,n,{components:a,mdxType:"MDXLayout"}),(0,m.kt)("h2",{id:"introduction"},"Introduction"),(0,m.kt)("p",null,"As we have talked on the seminar, if we construct from some vertex ",(0,m.kt)("span",{parentName:"p",className:"math math-inline"}
