// ++++++++++++++++++++++++++++++++++++++++
// 《零基础Go语言算法实战》源码
// ++++++++++++++++++++++++++++++++++++++++
// Author:廖显东（ShirDon）
// Blog:https://www.shirdon.com/
// Gitee:https://gitee.com/shirdonl/goAlgorithms.git
// Buy link :https://item.jd.com/14101229.html
// ++++++++++++++++++++++++++++++++++++++++

package main

import "gitee.com/shirdonl/goAlgorithms/chapter6/6.1/graph"

var gra graph.ItemGraph

func main() {
	nodeA := graph.Node{"A"}
	nodeB := graph.Node{"B"}
	nodeC := graph.Node{"C"}

	gra.AddNode(&nodeA)
	gra.AddNode(&nodeB)
	gra.AddNode(&nodeC)

	gra.AddEdge(&nodeA, &nodeB)
	gra.AddEdge(&nodeA, &nodeC)
	gra.AddEdge(&nodeB, &nodeC)
	gra.String()
}

//$ go run graphExapmle1.go
//A -> B C
//B -> A C
//C -> A B