0

0

PHP实现图的邻矩阵及普利姆算法(Prim)

php中文网

php中文网

发布时间:2016-06-21 08:53:04

|

1777人浏览过

|

来源于php中文网

原创

<ol class="dp-c"><li class="alt"><span><span><?php </span></span></li><li><span>    <span class="keyword">require</span><span> </span><span class="string">'mGraph.php'</span><span>; </span></span></li><li class="alt"><span>    <span class="vars">$a</span><span> = </span><span class="keyword">array</span><span>(</span><span class="string">'a'</span><span>, </span><span class="string">'b'</span><span>, </span><span class="string">'c'</span><span>, </span><span class="string">'d'</span><span>, </span><span class="string">'e'</span><span>, </span><span class="string">'f'</span><span>, </span><span class="string">'g'</span><span>, </span><span class="string">'h'</span><span>, </span><span class="string">'i'</span><span>); </span></span></li><li><span>    <span class="vars">$b</span><span> = </span><span class="keyword">array</span><span>(</span><span class="string">'ab'</span><span>=></span><span class="string">'10'</span><span>, </span><span class="string">'af'</span><span>=></span><span class="string">'11'</span><span>, </span><span class="string">'bg'</span><span>=></span><span class="string">'16'</span><span>, </span><span class="string">'fg'</span><span>=></span><span class="string">'17'</span><span>, </span><span class="string">'bc'</span><span>=></span><span class="string">'18'</span><span>, </span><span class="string">'bi'</span><span>=></span><span class="string">'12'</span><span>, </span><span class="string">'ci'</span><span>=></span><span class="string">'8'</span><span>, </span><span class="string">'cd'</span><span>=></span><span class="string">'22'</span><span>, </span><span class="string">'di'</span><span>=></span><span class="string">'21'</span><span>, </span><span class="string">'dg'</span><span>=></span><span class="string">'24'</span><span>, </span><span class="string">'gh'</span><span>=></span><span class="string">'19'</span><span>, </span><span class="string">'dh'</span><span>=></span><span class="string">'16'</span><span>, </span><span class="string">'de'</span><span>=></span><span class="string">'20'</span><span>, </span><span class="string">'eh'</span><span>=></span><span class="string">'7'</span><span>,</span><span class="string">'fe'</span><span>=></span><span class="string">'26'</span><span>);</span><span class="comment">//键为边,值权值</span><span> </span></span></li><li class="alt"><span>      </span></li><li><span>    <span class="vars">$test</span><span> = </span><span class="keyword">new</span><span> MGraph(</span><span class="vars">$a</span><span>, </span><span class="vars">$b</span><span>); </span></span></li><li class="alt"><span>    print_r(<span class="vars">$test</span><span>->prim()); </span></span></li><li><span>?> </span></li><li class="alt"><span><span class="comment">//mGraph.php</span><span> </span></span></li><li><span><?php </span></li><li class="alt"><span>    <span class="keyword">class</span><span> MGraph{ </span></span></li><li><span>        <span class="keyword">private</span><span> </span><span class="vars">$vexs</span><span>; </span><span class="comment">//顶点数组</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">private</span><span> </span><span class="vars">$arc</span><span>; </span><span class="comment">//边邻接矩阵,即二维数组       </span><span> </span></span></li><li><span>        <span class="keyword">private</span><span> </span><span class="vars">$arcData</span><span>; </span><span class="comment">//边的数组信息</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">private</span><span> </span><span class="vars">$direct</span><span>; </span><span class="comment">//图的类型(无向或有向)</span><span> </span></span></li><li><span>        <span class="keyword">private</span><span> </span><span class="vars">$hasList</span><span>; </span><span class="comment">//尝试遍历时存储遍历过的结点</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">private</span><span> </span><span class="vars">$queue</span><span>; </span><span class="comment">//广度优先遍历时存储孩子结点的队列,用数组模仿</span><span> </span></span></li><li><span>        <span class="keyword">private</span><span> </span><span class="vars">$infinity</span><span> = 65535;</span><span class="comment">//代表无穷,即两点无连接,建带权值的图时用,本示例不带权值 </span><span> </span></span></li><li class="alt"><span>        <span class="keyword">private</span><span> </span><span class="vars">$primVexs</span><span>; </span><span class="comment">//prim算法时保存顶点</span><span> </span></span></li><li><span>        <span class="keyword">private</span><span> </span><span class="vars">$primArc</span><span>; </span><span class="comment">//prim算法时保存边</span><span> </span></span></li><li class="alt"><span>         </span></li><li><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> MGraph(</span><span class="vars">$vexs</span><span>, </span><span class="vars">$arc</span><span>, </span><span class="vars">$direct</span><span> = 0){ </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->vexs = </span><span class="vars">$vexs</span><span>; </span></span></li><li><span>            <span class="vars">$this</span><span>->arcData = </span><span class="vars">$arc</span><span>; </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->direct = </span><span class="vars">$direct</span><span>; </span></span></li><li><span>            <span class="vars">$this</span><span>->initalizeArc(); </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->createArc();  </span></span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="keyword">private</span><span> </span><span class="keyword">function</span><span> initalizeArc(){ </span></span></li><li class="alt"><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->vexs </span><span class="keyword">as</span><span> </span><span class="vars">$value</span><span>){ </span></span></li><li><span>                <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->vexs </span><span class="keyword">as</span><span> </span><span class="vars">$cValue</span><span>){ </span></span></li><li class="alt"><span>                    <span class="vars">$this</span><span>->arc[</span><span class="vars">$value</span><span>][</span><span class="vars">$cValue</span><span>] = (</span><span class="vars">$value</span><span> == </span><span class="vars">$cValue</span><span> ? 0 : </span><span class="vars">$this</span><span>->infinity); </span></span></li><li><span>                } </span></li><li class="alt"><span>            } </span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="comment">//创建图 $direct:0表示无向图,1表示有向图</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">private</span><span> </span><span class="keyword">function</span><span> createArc(){ </span></span></li><li><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arcData </span><span class="keyword">as</span><span> </span><span class="vars">$key</span><span>=></span><span class="vars">$value</span><span>){ </span></span></li><li class="alt"><span>                <span class="vars">$strArr</span><span> = </span><span class="func">str_split</span><span>(</span><span class="vars">$key</span><span>); </span></span></li><li><span>                <span class="vars">$first</span><span> = </span><span class="vars">$strArr</span><span>[0]; </span></span></li><li class="alt"><span>                <span class="vars">$last</span><span> = </span><span class="vars">$strArr</span><span>[1]; </span></span></li><li><span>                  </span></li><li class="alt"><span>                <span class="vars">$this</span><span>->arc[</span><span class="vars">$first</span><span>][</span><span class="vars">$last</span><span>] = </span><span class="vars">$value</span><span>; </span></span></li><li><span>                <span class="keyword">if</span><span>(!</span><span class="vars">$this</span><span>->direct){ </span></span></li><li class="alt"><span>                    <span class="vars">$this</span><span>->arc[</span><span class="vars">$last</span><span>][</span><span class="vars">$first</span><span>] = </span><span class="vars">$value</span><span>;  </span></span></li><li><span>                } </span></li><li class="alt"><span>            } </span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="comment">//prim算法,生成最小生成树</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> prim(){ </span></span></li><li><span>            <span class="vars">$this</span><span>->primVexs = </span><span class="keyword">array</span><span>(); </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->primArc = </span><span class="keyword">array</span><span>(</span><span class="vars">$this</span><span>->vexs[0]=>0); </span></span></li><li><span>             </span></li><li class="alt"><span>            <span class="keyword">for</span><span>(</span><span class="vars">$i</span><span> = 1; </span><span class="vars">$i</span><span> < </span><span class="func">count</span><span>(</span><span class="vars">$this</span><span>->vexs); </span><span class="vars">$i</span><span> ++){ </span></span></li><li><span>                <span class="vars">$this</span><span>->primArc[</span><span class="vars">$this</span><span>->vexs[</span><span class="vars">$i</span><span>]] = </span><span class="vars">$this</span><span>->arc[</span><span class="vars">$this</span><span>->vexs[0]][</span><span class="vars">$this</span><span>->vexs[</span><span class="vars">$i</span><span>]]; </span></span></li><li class="alt"><span>                <span class="vars">$this</span><span>->primVexs[</span><span class="vars">$this</span><span>->vexs[</span><span class="vars">$i</span><span>]] = </span><span class="vars">$this</span><span>->vexs[0]; </span></span></li><li><span>            } </span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">for</span><span>(</span><span class="vars">$i</span><span> = 0; </span><span class="vars">$i</span><span> < </span><span class="func">count</span><span>(</span><span class="vars">$this</span><span>->vexs); </span><span class="vars">$i</span><span> ++){ </span></span></li><li class="alt"><span>                <span class="vars">$min</span><span> = </span><span class="vars">$this</span><span>->infinity; </span></span></li><li><span>                <span class="vars">$key</span><span>; </span></span></li><li class="alt"><span> </span></li><li><span>                <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->vexs </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li class="alt"><span>                    <span class="keyword">if</span><span>(</span><span class="vars">$this</span><span>->primArc[</span><span class="vars">$v</span><span>] != 0 && </span><span class="vars">$this</span><span>->primArc[</span><span class="vars">$v</span><span>] < </span><span class="vars">$min</span><span>){ </span></span></li><li><span>                        <span class="vars">$key</span><span> = </span><span class="vars">$v</span><span>; </span></span></li><li class="alt"><span>                        <span class="vars">$min</span><span> = </span><span class="vars">$this</span><span>->primArc[</span><span class="vars">$v</span><span>]; </span></span></li><li><span>                    } </span></li><li class="alt"><span>                } </span></li><li><span> </span></li><li class="alt"><span>                <span class="vars">$this</span><span>->primArc[</span><span class="vars">$key</span><span>] = 0; </span></span></li><li><span> </span></li><li class="alt"><span>                <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arc[</span><span class="vars">$key</span><span>] </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li><span>                    <span class="keyword">if</span><span>(</span><span class="vars">$this</span><span>->primArc[</span><span class="vars">$k</span><span>] != 0 && </span><span class="vars">$v</span><span> < </span><span class="vars">$this</span><span>->primArc[</span><span class="vars">$k</span><span>]){ </span></span></li><li class="alt"><span>                        <span class="vars">$this</span><span>->primArc[</span><span class="vars">$k</span><span>] = </span><span class="vars">$v</span><span>;   </span></span></li><li><span>                        <span class="vars">$this</span><span>->primVexs[</span><span class="vars">$k</span><span>] = </span><span class="vars">$key</span><span>;  </span></span></li><li class="alt"><span>                    } </span></li><li><span>                } </span></li><li class="alt"><span>            } </span></li><li><span> </span></li><li class="alt"><span>            <span class="keyword">return</span><span> </span><span class="vars">$this</span><span>->primVexs; </span></span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="comment">//一般算法,生成最小生成树</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> bst(){ </span></span></li><li><span>            <span class="vars">$this</span><span>->primVexs = </span><span class="keyword">array</span><span>(</span><span class="vars">$this</span><span>->vexs[0]); </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->primArc = </span><span class="keyword">array</span><span>(); </span></span></li><li><span> </span></li><li class="alt"><span>            next(<span class="vars">$this</span><span>->arc[key(</span><span class="vars">$this</span><span>->arc)]);  </span></span></li><li><span>            <span class="vars">$key</span><span> = NULL; </span></span></li><li class="alt"><span>            <span class="vars">$current</span><span> = NULL; </span></span></li><li><span> </span></li><li class="alt"><span>            <span class="keyword">while</span><span>(</span><span class="func">count</span><span>(</span><span class="vars">$this</span><span>->primVexs) < </span><span class="func">count</span><span>(</span><span class="vars">$this</span><span>->vexs)){ </span></span></li><li><span>                <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->primVexs </span><span class="keyword">as</span><span> </span><span class="vars">$value</span><span>){ </span></span></li><li class="alt"><span>                    <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arc[</span><span class="vars">$value</span><span>] </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li><span>                        <span class="keyword">if</span><span>(!in_array(</span><span class="vars">$k</span><span>, </span><span class="vars">$this</span><span>->primVexs) && </span><span class="vars">$v</span><span> != 0 && </span><span class="vars">$v</span><span> != </span><span class="vars">$this</span><span>->infinity){ </span></span></li><li class="alt"><span>                            <span class="keyword">if</span><span>(</span><span class="vars">$key</span><span> == NULL  </span><span class="vars">$v</span><span> < current(</span><span class="vars">$current</span><span>)){ </span></span></li><li><span>                                <span class="vars">$key</span><span> = </span><span class="vars">$k</span><span>; </span></span></li><li class="alt"><span>                                <span class="vars">$current</span><span> = </span><span class="keyword">array</span><span>(</span><span class="vars">$value</span><span> . </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>); </span></span></li><li><span>                            } </span></li><li class="alt"><span>                        } </span></li><li><span> </span></li><li class="alt"><span>                    } </span></li><li><span>                } </span></li><li class="alt"><span> </span></li><li><span>                <span class="vars">$this</span><span>->primVexs[] = </span><span class="vars">$key</span><span>; </span></span></li><li class="alt"><span>                <span class="vars">$this</span><span>->primArc[key(</span><span class="vars">$current</span><span>)] = current(</span><span class="vars">$current</span><span>); </span></span></li><li><span>                <span class="vars">$key</span><span> = NULL; </span></span></li><li class="alt"><span>                <span class="vars">$current</span><span> = NULL; </span></span></li><li><span>            } </span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">return</span><span> </span><span class="keyword">array</span><span>(</span><span class="string">'vexs'</span><span>=></span><span class="vars">$this</span><span>->primVexs, </span><span class="string">'arc'</span><span>=></span><span class="vars">$this</span><span>->primArc); </span></span></li><li class="alt"><span>        } </span></li><li><span> </span></li><li class="alt"><span>        <span class="comment">//一般遍历</span><span> </span></span></li><li><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> reserve(){ </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->hasList = </span><span class="keyword">array</span><span>(); </span></span></li><li><span> </span></li><li class="alt"><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arc </span><span class="keyword">as</span><span> </span><span class="vars">$key</span><span>=></span><span class="vars">$value</span><span>){ </span></span></li><li><span>                <span class="keyword">if</span><span>(!in_array(</span><span class="vars">$key</span><span>, </span><span class="vars">$this</span><span>->hasList)){ </span></span></li><li class="alt"><span>                    <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$key</span><span>; </span></span></li><li><span>                } </span></li><li class="alt"><span> </span></li><li><span>                <span class="keyword">foreach</span><span>(</span><span class="vars">$value</span><span> </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li class="alt"><span>                    <span class="keyword">if</span><span>(</span><span class="vars">$v</span><span> == 1 && !in_array(</span><span class="vars">$k</span><span>, </span><span class="vars">$this</span><span>->hasList)){ </span></span></li><li><span>                        <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$k</span><span>;    </span></span></li><li class="alt"><span>                    } </span></li><li><span>                } </span></li><li class="alt"><span>            } </span></li><li><span> </span></li><li class="alt"><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->vexs </span><span class="keyword">as</span><span> </span><span class="vars">$v</span><span>){ </span></span></li><li><span>                <span class="keyword">if</span><span>(!in_array(</span><span class="vars">$v</span><span>, </span><span class="vars">$this</span><span>->hasList)) </span></span></li><li class="alt"><span>                    <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$v</span><span>; </span></span></li><li><span>            } </span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">return</span><span> implode(</span><span class="vars">$this</span><span>->hasList); </span></span></li><li class="alt"><span>        } </span></li><li><span> </span></li><li class="alt"><span>        <span class="comment">//广度优先遍历</span><span> </span></span></li><li><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> bfs(){ </span></span></li><li class="alt"><span>            <span class="vars">$this</span><span>->hasList = </span><span class="keyword">array</span><span>(); </span></span></li><li><span>            <span class="vars">$this</span><span>->queue = </span><span class="keyword">array</span><span>(); </span></span></li><li class="alt"><span>             </span></li><li><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arc </span><span class="keyword">as</span><span> </span><span class="vars">$key</span><span>=></span><span class="vars">$value</span><span>){ </span></span></li><li class="alt"><span>                <span class="keyword">if</span><span>(!in_array(</span><span class="vars">$key</span><span>, </span><span class="vars">$this</span><span>->hasList)){ </span></span></li><li><span>                    <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$key</span><span>; </span></span></li><li class="alt"><span>                    <span class="vars">$this</span><span>->queue[] = </span><span class="vars">$value</span><span>; </span></span></li><li><span> </span></li><li class="alt"><span>                    <span class="keyword">while</span><span>(!</span><span class="func">empty</span><span class="keyword">empty</span><span>(</span><span class="vars">$this</span><span>->queue)){ </span></span></li><li><span>                        <span class="vars">$child</span><span> = </span><span class="func">array_shift</span><span>(</span><span class="vars">$this</span><span>->queue); </span></span></li><li class="alt"><span>                         </span></li><li><span>                        <span class="keyword">foreach</span><span>(</span><span class="vars">$child</span><span> </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li class="alt"><span>                            <span class="keyword">if</span><span>(</span><span class="vars">$v</span><span> == 1 && !in_array(</span><span class="vars">$k</span><span>, </span><span class="vars">$this</span><span>->hasList)){ </span></span></li><li><span>                                <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$k</span><span>; </span></span></li><li class="alt"><span>                                <span class="vars">$this</span><span>->queue[] = </span><span class="vars">$this</span><span>->arc[</span><span class="vars">$k</span><span>];    </span></span></li><li><span>                            } </span></li><li class="alt"><span>                        } </span></li><li><span>                    } </span></li><li class="alt"><span>                } </span></li><li><span>            } </span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">return</span><span> implode(</span><span class="vars">$this</span><span>->hasList); </span></span></li><li class="alt"><span>              </span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="comment">//执行深度优先遍历</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> excuteDfs(</span><span class="vars">$key</span><span>){ </span></span></li><li><span>            <span class="vars">$this</span><span>->hasList[] = </span><span class="vars">$key</span><span>;   </span></span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->arc[</span><span class="vars">$key</span><span>] </span><span class="keyword">as</span><span> </span><span class="vars">$k</span><span>=></span><span class="vars">$v</span><span>){ </span></span></li><li class="alt"><span>                <span class="keyword">if</span><span>(</span><span class="vars">$v</span><span> == 1 && !in_array(</span><span class="vars">$k</span><span>, </span><span class="vars">$this</span><span>->hasList)) </span></span></li><li><span>                    <span class="vars">$this</span><span>->excuteDfs(</span><span class="vars">$k</span><span>);    </span></span></li><li class="alt"><span>            } </span></li><li><span>        } </span></li><li class="alt"><span> </span></li><li><span>        <span class="comment">//深度优先遍历</span><span> </span></span></li><li class="alt"><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> dfs(){ </span></span></li><li><span>            <span class="vars">$this</span><span>->hasList = </span><span class="keyword">array</span><span>(); </span></span></li><li class="alt"><span> </span></li><li><span>            <span class="keyword">foreach</span><span>(</span><span class="vars">$this</span><span>->vexs </span><span class="keyword">as</span><span> </span><span class="vars">$key</span><span>){ </span></span></li><li class="alt"><span>                <span class="keyword">if</span><span>(!in_array(</span><span class="vars">$key</span><span>, </span><span class="vars">$this</span><span>->hasList))  </span></span></li><li><span>                    <span class="vars">$this</span><span>->excuteDfs(</span><span class="vars">$key</span><span>);  </span></span></li><li class="alt"><span>            } </span></li><li><span> </span></li><li class="alt"><span>            <span class="keyword">return</span><span> implode(</span><span class="vars">$this</span><span>->hasList); </span></span></li><li><span>        } </span></li><li class="alt"><span>        <span class="comment">//返回图的二维数组表示</span><span> </span></span></li><li><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> getArc(){ </span></span></li><li class="alt"><span>            <span class="keyword">return</span><span> </span><span class="vars">$this</span><span>->arc; </span></span></li><li><span>        } </span></li><li class="alt"><span>        <span class="comment">//返回结点个数</span><span> </span></span></li><li><span>        <span class="keyword">public</span><span> </span><span class="keyword">function</span><span> getVexCount(){ </span></span></li><li class="alt"><span>            <span class="keyword">return</span><span> </span><span class="func">count</span><span>(</span><span class="vars">$this</span><span>->vexs); </span></span></li><li><span>        } </span></li><li class="alt"><span>    } </span></li><li><span>?> </span></li></ol>

Cleanup.pictures
Cleanup.pictures

智能移除图片中的物体、文本、污迹、人物或任何不想要的东西

下载



PHP速学教程(入门到精通)
PHP速学教程(入门到精通)

PHP怎么学习?PHP怎么入门?PHP在哪学?PHP怎么学才快?不用担心,这里为大家提供了PHP速学教程(入门到精通),有需要的小伙伴保存下载就能学习啦!

下载

本站声明:本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn

热门AI工具

更多
DeepSeek
DeepSeek

幻方量化公司旗下的开源大模型平台

豆包大模型
豆包大模型

字节跳动自主研发的一系列大型语言模型

通义千问
通义千问

阿里巴巴推出的全能AI助手

腾讯元宝
腾讯元宝

腾讯混元平台推出的AI助手

文心一言
文心一言

文心一言是百度开发的AI聊天机器人,通过对话可以生成各种形式的内容。

讯飞写作
讯飞写作

基于讯飞星火大模型的AI写作工具,可以快速生成新闻稿件、品宣文案、工作总结、心得体会等各种文文稿

即梦AI
即梦AI

一站式AI创作平台,免费AI图片和视频生成。

ChatGPT
ChatGPT

最最强大的AI聊天机器人程序,ChatGPT不单是聊天机器人,还能进行撰写邮件、视频脚本、文案、翻译、代码等任务。

相关专题

更多
pixiv网页版官网登录与阅读指南_pixiv官网直达入口与在线访问方法
pixiv网页版官网登录与阅读指南_pixiv官网直达入口与在线访问方法

本专题系统整理pixiv网页版官网入口及登录访问方式,涵盖官网登录页面直达路径、在线阅读入口及快速进入方法说明,帮助用户高效找到pixiv官方网站,实现便捷、安全的网页端浏览与账号登录体验。

928

2026.02.13

微博网页版主页入口与登录指南_官方网页端快速访问方法
微博网页版主页入口与登录指南_官方网页端快速访问方法

本专题系统整理微博网页版官方入口及网页端登录方式,涵盖首页直达地址、账号登录流程与常见访问问题说明,帮助用户快速找到微博官网主页,实现便捷、安全的网页端登录与内容浏览体验。

307

2026.02.13

Flutter跨平台开发与状态管理实战
Flutter跨平台开发与状态管理实战

本专题围绕Flutter框架展开,系统讲解跨平台UI构建原理与状态管理方案。内容涵盖Widget生命周期、路由管理、Provider与Bloc状态管理模式、网络请求封装及性能优化技巧。通过实战项目演示,帮助开发者构建流畅、可维护的跨平台移动应用。

183

2026.02.13

TypeScript工程化开发与Vite构建优化实践
TypeScript工程化开发与Vite构建优化实践

本专题面向前端开发者,深入讲解 TypeScript 类型系统与大型项目结构设计方法,并结合 Vite 构建工具优化前端工程化流程。内容包括模块化设计、类型声明管理、代码分割、热更新原理以及构建性能调优。通过完整项目示例,帮助开发者提升代码可维护性与开发效率。

29

2026.02.13

Redis高可用架构与分布式缓存实战
Redis高可用架构与分布式缓存实战

本专题围绕 Redis 在高并发系统中的应用展开,系统讲解主从复制、哨兵机制、Cluster 集群模式及数据分片原理。内容涵盖缓存穿透与雪崩解决方案、分布式锁实现、热点数据优化及持久化策略。通过真实业务场景演示,帮助开发者构建高可用、可扩展的分布式缓存系统。

103

2026.02.13

c语言 数据类型
c语言 数据类型

本专题整合了c语言数据类型相关内容,阅读专题下面的文章了解更多详细内容。

54

2026.02.12

雨课堂网页版登录入口与使用指南_官方在线教学平台访问方法
雨课堂网页版登录入口与使用指南_官方在线教学平台访问方法

本专题系统整理雨课堂网页版官方入口及在线登录方式,涵盖账号登录流程、官方直连入口及平台访问方法说明,帮助师生用户快速进入雨课堂在线教学平台,实现便捷、高效的课程学习与教学管理体验。

17

2026.02.12

豆包AI网页版入口与智能创作指南_官方在线写作与图片生成使用方法
豆包AI网页版入口与智能创作指南_官方在线写作与图片生成使用方法

本专题汇总豆包AI官方网页版入口及在线使用方式,涵盖智能写作工具、图片生成体验入口和官网登录方法,帮助用户快速直达豆包AI平台,高效完成文本创作与AI生图任务,实现便捷智能创作体验。

764

2026.02.12

PostgreSQL性能优化与索引调优实战
PostgreSQL性能优化与索引调优实战

本专题面向后端开发与数据库工程师,深入讲解 PostgreSQL 查询优化原理与索引机制。内容包括执行计划分析、常见索引类型对比、慢查询优化策略、事务隔离级别以及高并发场景下的性能调优技巧。通过实战案例解析,帮助开发者提升数据库响应速度与系统稳定性。

92

2026.02.12

热门下载

更多
网站特效
/
网站源码
/
网站素材
/
前端模板

精品课程

更多
相关推荐
/
热门推荐
/
最新课程
JavaScript高级框架设计视频教程
JavaScript高级框架设计视频教程

共22课时 | 3.6万人学习

AngularJS教程
AngularJS教程

共24课时 | 3.8万人学习

CSS3实现按钮特效视频教程
CSS3实现按钮特效视频教程

共15课时 | 3.3万人学习

关于我们 免责申明 举报中心 意见反馈 讲师合作 广告合作 最新更新
php中文网:公益在线php培训,帮助PHP学习者快速成长!
关注服务号 技术交流群
PHP中文网订阅号
每天精选资源文章推送

Copyright 2014-2026 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号