In some Graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input Graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
Specification File
adjacencyListGragh
class GeneralGraph:
use adjacency list to implement the Graph which data structure is vector
Construct methods:
* public GeneralGraph():
contain an empty vector store the vertex and a boolean determines whether Graph is directed or not, defaulted is undirected
This program illustrates the effect of alising
of frequency leading to signal distortion,the output Graph illustrates frequency respose due to alliasing,easy for students learning DSP
Program to plot x(t) =1/2+∑_(n=1)^∞▒ (sinc 〖n/2〗 〖 cos 〗 〖2πnt/4〗 )
Include n-value (Number of Terms) in Graph on plot.
Show 2 Graphs, original and simulated together.
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network.
Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three Graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a Graph from a le, where
airports are represented as vertices and
ights between airports are represented
as edges, take as input two airports and calculate the shortest route (ie path)
between them.
Description
Scientific calculator. Allows to perform caclulation with high precicion and implements most populatr mathematical functions: sin, cos, tan, asin, acon, atan, exp, log, sqr, floor and ceil. Also it make it possible to define your own function, store results in variables and use variable sin expressions. Calculator store al formuls you have entered. Plot function can be used to draw Graph of function with single argument.
More detailed description of calculator is here.
