func main() {
var g *graph.DefaultGraph
g, _ = utils.ReadFileToGraph("topology.txt")
g = utils.ReadFile("topology.txt")
fmt.Print(g.String())
labels := utils.GetLabelList(g)
fmt.Println(labels)
neighbors, _ := utils.GetNeighborMap(g)
fmt.Println(neighbors)
}
func main() {
var filename string
var address string
var name string
var nodeLabels []string
var topology graph.Graph
var fileErr error
var input string
fmt.Print("[create|connect]> ")
fmt.Scanln(&input)
if input == "store" {
fmt.Print("enter topology filename > ")
fmt.Scanln(&filename)
fmt.Print("enter topology name > ")
fmt.Scanln(&name)
fmt.Print("enter address and port of database > ")
fmt.Scanln(&address)
if address == "" {
fmt.Println("- no address specified, using default database")
address = "128.153.144.171:6379"
}
topology, fileErr = utils.ReadFileToGraph(filename)
if fileErr != nil {
panic(fileErr)
}
nodeLabels = utils.GetLabelList(topology)
numberOfNodes := len(nodeLabels)
labelMap := utils.GetLabelMap(topology)
rdb, err := database.NewRoutingDatabase(name, "tcp", address, labelMap)
fmt.Println("Connecting to data base")
if err != nil {
panic(err)
}
fmt.Println("Connected")
fmt.Println("Setting paths")
var src, dest string
for i := 0; i < numberOfNodes; i++ {
for j := 0; j < numberOfNodes; j++ {
if i != j {
src = nodeLabels[i]
dest = nodeLabels[j]
paths, distance, _ := graph.Dijkstra(topology, src, dest)
path := strings.Join(paths[1:], " ")
rdb.SetPath(src, dest, fmt.Sprintf("%s %s | %d", src, path, int(distance[dest])))
}
}
}
fmt.Println("Paths set, storing paths")
rdb.StorePathsInDB()
fmt.Println("Paths stored in data base")
rdb.Disconnect()
} else if input == "grab" {
fmt.Print("enter topology name > ")
fmt.Scanln(&name)
fmt.Print("enter address and port of database > ")
fmt.Scanln(&address)
if address == "" {
fmt.Println("- no address specified, using default database")
address = "128.153.144.171:6379"
}
rdb, err := database.NewRoutingDatabaseFromDB(name, "tcp", address)
if err != nil {
panic(err)
}
fmt.Println("Connected")
var src, dest string
for {
fmt.Print("Enter a first node > ")
fmt.Scanln(&input)
src = input
fmt.Print("Enter a second node > ")
fmt.Scanln(&input)
dest = input
path, DBerr := rdb.GetPathFromDB(src, dest)
if DBerr != nil {
panic(DBerr)
}
fmt.Println("The shortest path is: ", path)
}
rdb.Disconnect()
} else {
fmt.Println("invalid input program terminated")
}
}