The Political and Religious importance of the city of Thebes In ancient Egypt Since the beginning of the middle government era until the ending modern government era(2143– 1090 BC)

Thebes has came into existence (the current city of Luxor) as a village of the upper villages of Egypt since the third alpha B.C, where the old Egyptian human inhabited it and during the Egyptian dynasties it occupied an important role in the history of Egypt on its expansion. during the old government era Thebes was still a simple village and Amun was a little important local god, where the desting of Thebes and its god Amun connected together from power and sthenia, when the rulersʼs strength of Thebes glorified during the middle government era to expansion in both upper and lower Egypt. So it grew the authority of Amun and He became the first national god and when the rulers of Thebes lead the struggle war against the Hyksos, the god Amun became the resistence god and with the extraneous Egyptian expansion which followed the removing of the Hyksos and its yield the building of the Egyptian empire in Syria during the modern government era, Amun, the god became the global god and the kings of Egypt indebted to the god Amun of their success and this show during of His much having from the income of His temples and in opposition Amun gave generously of his blessing on the dead kings who bury in the graveyards of Thebes.

A Comparison between complexity of the famous shortest path algorithms

The shortest path problem can be categorized in to two different problems; single source shortest path problem (SSSP) and all pair shortest algorithm (APSP). In this paper, analysis and comparison between complexity of the famous shortest path algorithms have been made, and the obtained results have shown that researchers have got remarkable success in designing better algorithms in the terms of time complexity to solve shortest path algorithms.

An efficient algorithm for finding a shortest paths for all vertices in graph

The all-nodes shortest paths problem is undoubtedly one of the most basic problems in algorithmic graph theory. In this paper, we introduce simple and efficient algorithm for all nodes shortest paths problem for directed (undirected) graphs. In this problem, we find the shortest path from a given source node to all other nodes in the graph, in which the shortest path is a path with minimum cost, i.e., sum of the edge weights. We proved that the complexity of the proposed algorithm in this paper depends only on the edges graph, and we show that the time of implementation of this algorithm is linear time O(m) and This is considered the best times of the algorithms at all. And a Comparison between complexity of proposed algorithm and the famous shortest path algorithms have been made, and the obtained results have shown that the complexity of the proposed algorithm is best.

Design a linear time Algorithm for Finding A shortest path in Graph

In this paper, we introduce an Effective algorithm to find the shortest path in Multiple – Source Graph, by choosing the path between the source and the distance that gives at least the length of the path down to the sink. This algorithm is based on the principle of iteration to access the optimal solution of the shortest-path problem, Where the algorithm steps are repeated for all the darts in the Graph. We proved that the time of implementation of the proposed algorithm in this paper is linear time O(n+L) and This is considered the best times of the algorithms at all.