Implementation of Shortest Route framed in GUI

This algorithm will find out the Shortest Route in the network Topologies.

Description

The GUI framed in this m-file will find out the Shortest Route in the network Topologies. First, User have to load the network (Adjacent matrix). Then run the algorithm and fill the information in GUI like Source node, Destination Node and total number of nodes. The results will come on screen (GUI front panel). The results are shortest roue and optimal cost.

• MATLAB release: MATLAB 7 (R14)

[Anon]

Shortest_route returns an error when called. May be you forgot to submit the Shortest_route.fig file. But, please, before you resubmit, please add a more informative help to your m-file. As it stands now, I only know from the text above, that a adjacency matrix is required.

>> Shortest_route
??? Error using ==> load
Unable to read file Shortest_route.fig: No such file or directory.

Error in ==> hgload at 43
fileVars = load(filename,'-mat');

Error in ==> openfig at 72
    [fig, savedvisible] = hgload(filename, struct('Visible','off'));

Error in ==> gui_mainfcn>local_openfig at 286
    gui_hFigure = openfig(name, singleton, visible);

Error in ==> gui_mainfcn at 159
        gui_hFigure = local_openfig(gui_State.gui_Name, gui_SingletonOpt, gui_Visible);

Error in ==> Shortest_route at 19
    gui_mainfcn(gui_State, varargin{:});

[Ranjit]