PHP完成克鲁斯卡尔算法实例剖析

本文实例展现了PHP完成的格鲁斯卡尔算法（kruscal）的完成体例，分享给大师供大师参考。信任对大师的PHP法式设想有必然的鉴戒代价。

详细代码以下：

<?php
require "edge.php";
$a = array(
  "a",
  "b",
  "c",
  "d",
  "e",
  "f",
  "g",
  "h",
  "i"
);
$b = array(
  "ab" => "10",
  "af" => "11",
  "gb" => "16",
  "fg" => "17",
  "bc" => "18",
  "bi" => "12",
  "ci" => "8",
  "cd" => "22",
  "di" => "21",
  "dg" => "24",
  "gh" => "19",
  "dh" => "16",
  "de" => "20",
  "eh" => "7",
  "fe" => "26"
);
$test = new Edge($a, $b);
print_r($test->kruscal());
?>

edge.php文件代码以下：

<?php
//边集数组的边类
class EdgeArc {
  private $begin; //肇端点
  private $end; //竣事点
  private $weight; //权值
  public function EdgeArc($begin, $end, $weight) {
    $this->begin = $begin;
    $this->end = $end;
    $this->weight = $weight;
  }
  public function getBegin() {
    return $this->begin;
  }
  public function getEnd() {
    return $this->end;
  }
  public function getWeight() {
    return $this->weight;
  }
}
class Edge {
  //边集数组完成图
  private $vexs; //极点调集
  private $arc; //边调集
  private $arcData; //要构建图的边信息
  private $krus; //kruscal算法时寄存丛林信息
  public function Edge($vexsData, $arcData) {
    $this->vexs = $vexsData;
    $this->arcData = $arcData;
    $this->createArc();
  }
  //建立边
  private function createArc() {
    foreach ($this->arcData as $key => $value) {
      $key = str_split($key);
      $this->arc[] = new EdgeArc($key[0], $key[1], $value);
    }
  }
  //对边数组按权值排序
  public function sortArc() {
    $this->quicklySort(0, count($this->arc) - 1, $this->arc);
    return $this->arc;
  }
  //接纳快排
  private function quicklySort($begin, $end, &$item) {
    if ($begin < 0($begin >= $end)) return;
    $key = $this->excuteSort($begin, $end, $item);
    $this->quicklySort(0, $key - 1, $item);
    $this->quicklySort($key + 1, $end, $item);
  }
  private function excuteSort($begin, $end, &$item) {
    $key = $item[$begin];
    $left = array();
    $right = array();
    for ($i = ($begin + 1); $i <= $end; $i++) {
      if ($item[$i]->getWeight() <= $key->getWeight()) {
        $left[] = $item[$i];
      } else {
        $right[] = $item[$i];
      }
    }
    $return = $this->unio($left, $right, $key);
    $k = 0;
    for ($i = $begin; $i <= $end; $i++) {
      $item[$i] = $return[$k];
      $k++;
    }
    return $begin + count($left);
  }
  private function unio($left, $right, $key) {
    return array_merge($left, array(
      $key
    ) , $right);
  }
  //kruscal算法
  public function kruscal() {
    $this->krus = array();
    $this->sortArc();
    foreach ($this->vexs as $value) {
      $this->krus[$value] = "0";
    }
    foreach ($this->arc as $key => $value) {
      $begin = $this->findRoot($value->getBegin());
      $end = $this->findRoot($value->getEnd());
      if ($begin != $end) {
        $this->krus[$begin] = $end;
        echo $value->getBegin() . "-" . $value->getEnd() . ":" . $value->getWeight() . "
";
      }
    }
  }
  //查找子树的尾结点
  private function findRoot($node) {
    while ($this->krus[$node] != "0") {
      $node = $this->krus[$node];
    }
    return $node;
  }
}
?> 

感乐趣的读者能够调试运转一下本文克鲁斯卡尔算法实例，信任会有新的收成。