Consider the diagram below, use Dijkstra’s link-state routing algorithm compute the least cost path from X to all other nodes and show the resulting forwarding table in x……
*This is java programming Write a main application called Project1.java, and a GUI (that extends JFrame) called WordGUI.java. The main program should open
*This is java programming Write a main application called Project1.java, and a GUI (that extends JFrame) called WordGUI.java. The main program should open a file called “input.txt” which will contain words, one per line. As the words are read from the file, they should be displayed in the GUI as