update

mohuishou · mohuishou · commit 945fff2a329b · 2017-04-08T17:01:07.000+08:00
diff --git a/Graph/Graph.go b/Graph/Graph.go
@@ -0,0 +1,44 @@
+package Graph
+
+// EdgeType 边的权值类型
+type EdgeType int
+
+// VextexType 顶点类型定义
+type VextexType int
+
+// VextexDataType 顶点值类型定义
+type VextexDataType int
+
+//EdgeNode 边的节点
+type EdgeNode struct {
+	weight EdgeType   //权值
+	v      VextexType //指向储存该顶点的下标
+	next   *EdgeNode  //指向下一条边
+}
+
+//VextexNode 顶点节点定义
+type VextexNode struct {
+	data      VextexDataType //顶点的值
+	FisrtEdge *EdgeNode      //该顶点指向的第一条边
+}
+
+//Graph 图
+type Graph []VextexNode
+
+//CreateGraph 创建邻接表
+func CreateGraph(n int) (graph Graph) {
+	graph = make(Graph, n)
+	for i := 0; i < n; i++ {
+		graph[i] = VextexNode{}
+	}
+	return graph
+}
+
+//AddEdge 添加边
+func (graph Graph) AddEdge(s, t VextexType, weight EdgeType) {
+	edge := &EdgeNode{v: t, weight: weight}
+
+	//添加边到头部
+	edge.next = graph[s].FisrtEdge
+	graph[s].FisrtEdge = edge
+}
diff --git a/Graph/Graph_test.go b/Graph/Graph_test.go
@@ -0,0 +1,12 @@
+package Graph
+
+import (
+	"testing"
+)
+
+func TestGraph(t *testing.T) {
+	graph := CreateGraph(3)
+	graph.AddEdge(0, 1, 1)
+	graph.AddEdge(0, 2, 2)
+	graph.AddEdge(1, 2, 3)
+}
diff --git a/Graph/README.MD b/Graph/README.MD
@@ -0,0 +1,4 @@
+Graph
+====
+
+建图
diff --git a/ShortestPath/Dijkstra.go b/ShortestPath/Dijkstra.go
@@ -1 +1,6 @@
 package ShortestPath
+
+//Dijkstra 算法
+func Dijkstra() {
+
+}

-Original file line number
+Diff line change
@@ @@ -0,0 +1,4 @@ @@
 +Graph
 +====
++
 +建图