monkeycoderw
diff --git a/‎.test.php.swp
0 Bytes b/‎.test.php.swp
0 Bytes
diff --git a/‎Graphic/.GraALG.php.swo
12 KB b/‎Graphic/.GraALG.php.swo
12 KB
diff --git a/‎Graphic/.GraALG.php.swp
12 KB b/‎Graphic/.GraALG.php.swp
12 KB
diff --git a/‎Graphic/GraALG.php
Lines changed: 24 additions & 2 deletions b/‎Graphic/GraALG.php
Lines changed: 24 additions & 2 deletions
diff --git a/‎index.php
Lines changed: 8 additions & 0 deletions b/‎index.php
Lines changed: 8 additions & 0 deletions
diff --git a/‎test.php
Lines changed: 17 additions & 18 deletions b/‎test.php
Lines changed: 17 additions & 18 deletions
@@ -3,10 +3,14 @@
 namespace Graphic;
 
 class GraALG {
+    const INFINITY = 65535;
+    const CONNECT  = 1;
     public $verex;
     public $edges;
     public $graphic;
-
+    //dijkstr用来记录最短路径和前置节点
+    public $dijkstra;
+    public $adjMatrix;
     public function __construct($verex, $edges, $graphic) {
         $this->verex = $verex;
         $this->edges = $edges;
@@ -58,6 +62,24 @@ public function BFSTraverse() {
         }     
     }
 
+    //邻接表转换成邻接矩阵
+    public function toAdjMatrix() {
+        $this->adjMatrix = array();
+        foreach ($this->verex as $vex_i) {
+            $arr = array();
+            foreach ($this->verex as $vex_j) {
+                $edge_key = $vex_i->name . $vex_j->name;
+                if (!empty($this->edges[$edge_key])) {
+                    $arr [] = $this->edges[$edge_key]->weight;                    
+                } else {
+                    $arr [] = self::INFINITY;
+                }
+            }
+            $this->adjMatrix [] = $arr;
+        }        
+    }
     //最短路径的问题
-     
+    public function shortestPathDijkstrai() {
+           
+    }
 }
@@ -0,0 +1,8 @@
+<html>
+<head>
+
+<head>
+<body>
+<div><a href='../test.php'  />hello</div>
+</body>
+</html>
@@ -8,29 +8,26 @@
 use Graphic\Edge;
 use Graphic\GraALG;
 
-$begin_int = ord('A');
-$verex = array();
-//定义结点,初始化A-E的节点
 for ($i = 0; $i < 9; $i++) {
-    $letter = chr($begin_int + $i);
-    $verex [$letter] = new Vertex($letter);  
+    $verex [$i] = new Vertex($i);  
 }
 //定义边
-$edge_arr = array('AB', 'AF',
-    'BA', 'BC', 'BG', 'BI',
-    'CB', 'CD', 'CI',
-    'DC', 'DE', 'DG', 'DH', 'DI',
-    'ED', 'EF', 'EH',
-    'FA', 'FE', 'FG',
-    'GB', 'GD', 'GF', 'GH',
-    'HD', 'HE', 'HG',
-    'IB', 'IC', 'ID'
+$edge_arr = array('011', '025',
+    '101', '123', '137', '145',
+    '205', '213', '241', '257',
+    '317', '342', '363',
+    '415', '421', '432', '453', '466', '479',
+    '527', '543', '575',
+    '633', '646', '672', '687',
+    '749', '755', '762', '784',
+    '867', '874'  
 );
 $edges = array();
 foreach ($edge_arr as $edge) {
-    $tail = substr($edge, 0, 1);
-    $head = substr($edge, 1, 1);
-    $edges[$edge] = new Edge($head, $tail);
+    $tail   = substr($edge, 0, 1);
+    $head   = substr($edge, 1, 1);
+    $weight = intval(substr($edge, 2, 1));
+    $edges[$tail.$head] = new Edge($head, $tail, $weight);
 }
 //定义图
 $graphic_arr = array();
@@ -45,4 +42,6 @@
 }
 $graphic = new GraALG($verex, $edges, $graphic_arr);
 #$graphic->DFSTraverse();
-$graphic->BFSTraverse();
+#$graphic->BFSTraverse();
+$graphic->toAdjMatrix();
+print_r($graphic->adjMatrix);
-Original file line number
+Diff line change
@@ @@ -0,0 +1,8 @@ @@
 +<html>
 +<head>
++
 +<head>
 +<body>
 +<div><a href='../test.php'  />hello</div>
 +</body>
 +</html>