1import{_ as f,u as m,r as l,o as v,c as b,a as r,w as t,b as a,n as c,g as n,d as e}from"./index-BCct5f0E.js";const L={setup(){const s=m();s.article.log=[{status:["M"],files:["src/prose/logic/pipes/outdegree.md"],abbrevHash:"f2a184e",hash:"f2a184e7ea9bda0e67a1c501a11c58e47902efc9",subject:"feat: Start overhauling Baleada Features docs for v0.14, and redesign the site",authorName:"Alex Vipond",authorDate:"2024-08-21 19:50:00 -0500"}],s.article.frontMatter={title:"outdegree",source:"graph-node.ts",tests:"node/graph-node.test.ts",publish:!1,order:0},s.article.relativePath="src/prose/logic/pipes/outdegree.md",s.article.source="https://github.com/baleada/logic/tree/main/src/pipes/graph-node.ts",s.article.tests="https://github.com/baleada/logic/tree/main/tests/node/graph-node.test.ts",s.article.stub=!1}},y={class:"baleada-prose-article"},A={class:"mb-7 flex flex-col gap-2"},B=e("code",null,"createOutdegree",-1),k=e("p",null,[a("Call "),e("code",null,"createOutdegree"),a(" with these parameters to create your "),e("code",null,"outdegree"),a(" function:")],-1),w=e("code",null,"graph",-1),x=[w];function P(s,C,R,T,N,V){const i=l("BaleadaProseHeading"),p=l("LayoutArticleLog"),u=l("LayoutArticleLinks"),d=l("RouterLink"),g=l("BaleadaProseTable"),_=l("LayoutAdjacentArticleLinks"),h=l("LayoutArticleEdit");return v(),b("article",y,[r(i,c(n({level:1,isFirst:!0})),{default:t(()=>[a(" outdegree")]),_:1},16),e("p",A,[r(p),r(u)]),e("p",null,[B,a(" is a "),r(d,{to:"/docs/logic/pipes-overview",rel:"noopener"},{default:t(()=>[a("pipe")]),_:1}),a(" that transforms a "),r(d,{to:"/docs/logic/graph-overview#graph-node-and-edge",rel:"noopener"},{default:t(()=>[a("node")]),_:1}),a(" to the total number of its outgoing edges.")]),r(i,c(n({level:2,isFirst:!1})),{default:t(()=>[a(" Create outdegree")]),_:1},16),k,r(g,c(n({ariaLabel:"createOutdegree parameters",classes:"wide-4",totalBodyRows:1,totalColumns:4})),{"looped-0-looped-0-looped-0":t(({ref:o})=>[e("div",{ref:o},"Parameter",512)]),"looped-0-looped-0-looped-1":t(({ref:o})=>[e("div",{ref:o},"Type",512)]),"looped-0-looped-0-looped-2":t(({ref:o})=>[e("div",{ref:o},"Required",512)]),"looped-0-looped-0-looped-3":t(({ref:o})=>[e("div",{ref:o},"Description",512)]),"looped-1-looped-0-looped-0":t(({ref:o})=>[e("div",{ref:o},x,512)]),"looped-1-looped-0-looped-1":t(({ref:o})=>[e("div",{ref:o},[r(d,{to:"/docs/logic/graph-overview",rel:"noopener"},{default:t(()=>[a("graph")]),_:1})],512)]),"looped-1-looped-0-looped-2":t(({ref:o})=>[e("div",{ref:o},"yes",512)]),"looped-1-looped-0-looped-3":t(({ref:o})=>[e("div",{ref:o},"The graph to analyze.",512)]),_:1},16),e("p",null,[r(_),r(h)])])}const j=f(L,[["render",P]]);export{j as default};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.