build based on 57cd3ac

dev/algorithms/biconnectivity/index.html

@@ -9,7 +9,7 @@
 3-element Vector{Int64}:
  2
  3
- 4</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/d3b2706768672e160d4b00ca4496270ff0561c14/src/biconnectivity/articulation.jl#L1-L21">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.Biconnections" href="#Graphs.Biconnections"><code>Graphs.Biconnections</code></a> — <span class="docstring-category">Type</span></header><section><div><pre><code class="language-julia">Biconnections</code></pre><p>A state type for depth-first search that finds the biconnected components.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/d3b2706768672e160d4b00ca4496270ff0561c14/src/biconnectivity/biconnect.jl#L1-L5">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.biconnected_components" href="#Graphs.biconnected_components"><code>Graphs.biconnected_components</code></a> — <span class="docstring-category">Function</span></header><section><div><pre><code class="language-julia">biconnected_components(g) -&gt; Vector{Vector{Edge{eltype(g)}}}</code></pre><p>Compute the <a href="https://en.wikipedia.org/wiki/Biconnected_component">biconnected components</a> of an undirected graph <code>g</code>and return a vector of vectors containing each biconnected component.</p><p>Performance: Time complexity is <span>$\mathcal{O}(|V|)$</span>.</p><p><strong>Examples</strong></p><pre><code class="language-julia-repl">julia&gt; using Graphs
+ 4</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/57cd3ac7de62a664f7d273c3834940f630c812c8/src/biconnectivity/articulation.jl#L1-L21">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.Biconnections" href="#Graphs.Biconnections"><code>Graphs.Biconnections</code></a> — <span class="docstring-category">Type</span></header><section><div><pre><code class="language-julia">Biconnections</code></pre><p>A state type for depth-first search that finds the biconnected components.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/57cd3ac7de62a664f7d273c3834940f630c812c8/src/biconnectivity/biconnect.jl#L1-L5">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.biconnected_components" href="#Graphs.biconnected_components"><code>Graphs.biconnected_components</code></a> — <span class="docstring-category">Function</span></header><section><div><pre><code class="language-julia">biconnected_components(g) -&gt; Vector{Vector{Edge{eltype(g)}}}</code></pre><p>Compute the <a href="https://en.wikipedia.org/wiki/Biconnected_component">biconnected components</a> of an undirected graph <code>g</code>and return a vector of vectors containing each biconnected component.</p><p>Performance: Time complexity is <span>$\mathcal{O}(|V|)$</span>.</p><p><strong>Examples</strong></p><pre><code class="language-julia-repl">julia&gt; using Graphs
 
 julia&gt; biconnected_components(star_graph(5))
 4-element Vector{Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}}:
@@ -20,7 +20,7 @@
 
 julia&gt; biconnected_components(cycle_graph(5))
 1-element Vector{Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}}:
- [Edge 1 =&gt; 5, Edge 4 =&gt; 5, Edge 3 =&gt; 4, Edge 2 =&gt; 3, Edge 1 =&gt; 2]</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/d3b2706768672e160d4b00ca4496270ff0561c14/src/biconnectivity/biconnect.jl#L64-L89">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.visit!-Union{Tuple{E}, Tuple{AbstractGraph, Graphs.Biconnections{E}, Integer, Integer}} where E" href="#Graphs.visit!-Union{Tuple{E}, Tuple{AbstractGraph, Graphs.Biconnections{E}, Integer, Integer}} where E"><code>Graphs.visit!</code></a> — <span class="docstring-category">Method</span></header><section><div><pre><code class="language-julia">visit!(g, state, u, v)</code></pre><p>Perform a DFS visit storing the depth and low-points of each vertex.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/d3b2706768672e160d4b00ca4496270ff0561c14/src/biconnectivity/biconnect.jl#L22-L26">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.bridges" href="#Graphs.bridges"><code>Graphs.bridges</code></a> — <span class="docstring-category">Function</span></header><section><div><pre><code class="language-julia">bridges(g)</code></pre><p>Compute the <a href="https://en.m.wikipedia.org/wiki/Bridge_(graph_theory)">bridges</a> of a connected graph <code>g</code> and return an array containing all bridges, i.e edges whose deletion increases the number of connected components of the graph.</p><p><strong>Examples</strong></p><pre><code class="language-julia-repl">julia&gt; using Graphs
+ [Edge 1 =&gt; 5, Edge 4 =&gt; 5, Edge 3 =&gt; 4, Edge 2 =&gt; 3, Edge 1 =&gt; 2]</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/57cd3ac7de62a664f7d273c3834940f630c812c8/src/biconnectivity/biconnect.jl#L64-L89">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.visit!-Union{Tuple{E}, Tuple{AbstractGraph, Graphs.Biconnections{E}, Integer, Integer}} where E" href="#Graphs.visit!-Union{Tuple{E}, Tuple{AbstractGraph, Graphs.Biconnections{E}, Integer, Integer}} where E"><code>Graphs.visit!</code></a> — <span class="docstring-category">Method</span></header><section><div><pre><code class="language-julia">visit!(g, state, u, v)</code></pre><p>Perform a DFS visit storing the depth and low-points of each vertex.</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/57cd3ac7de62a664f7d273c3834940f630c812c8/src/biconnectivity/biconnect.jl#L22-L26">source</a></section></article><article class="docstring"><header><a class="docstring-binding" id="Graphs.bridges" href="#Graphs.bridges"><code>Graphs.bridges</code></a> — <span class="docstring-category">Function</span></header><section><div><pre><code class="language-julia">bridges(g)</code></pre><p>Compute the <a href="https://en.m.wikipedia.org/wiki/Bridge_(graph_theory)">bridges</a> of a connected graph <code>g</code> and return an array containing all bridges, i.e edges whose deletion increases the number of connected components of the graph.</p><p><strong>Examples</strong></p><pre><code class="language-julia-repl">julia&gt; using Graphs
 
 julia&gt; bridges(star_graph(5))
 4-element Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}:
@@ -34,4 +34,4 @@
  Edge 4 =&gt; 5
  Edge 3 =&gt; 4
  Edge 2 =&gt; 3
- Edge 1 =&gt; 2</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/d3b2706768672e160d4b00ca4496270ff0561c14/src/biconnectivity/bridge.jl#L1-L25">source</a></section></article></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../../core_functions/simplegraphs/">« SimpleGraphs formats</a><a class="docs-footer-nextpage" href="../centrality/">Centrality measures »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> on <span class="colophon-date" title="Wednesday 5 July 2023 08:58">Wednesday 5 July 2023</span>. Using Julia version 1.9.1.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+ Edge 1 =&gt; 2</code></pre></div><a class="docs-sourcelink" target="_blank" href="https://github.com/JuliaGraphs/Graphs.jl/blob/57cd3ac7de62a664f7d273c3834940f630c812c8/src/biconnectivity/bridge.jl#L1-L25">source</a></section></article></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../../core_functions/simplegraphs/">« SimpleGraphs formats</a><a class="docs-footer-nextpage" href="../centrality/">Centrality measures »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> on <span class="colophon-date" title="Thursday 6 July 2023 08:49">Thursday 6 July 2023</span>. Using Julia version 1.9.2.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>