Description: Ability to store and represent a given topology 2) to achieve Dijkstra algorithm and Bellman-ford 3) according to a specified node, the algorithm generates a routing table and demonstrates the implementation of each step 4) extra points: GUI interface demo all the information
To Search:
File list (Check if you may need any files):
rout-gui\main.cpp
........\main.o
........\mainwindow.cpp
........\mainwindow.h
........\mainwindow.o
........\mainwindow.ui
........\Makefile
........\moc_mainwindow.cpp
........\moc_mainwindow.o
........\ui_mainwindow.h
........\zdlj
........\zdlj.pro
........\zdlj.pro.user
rout-gui
Download