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.
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
al
gorithms 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.
As a result of the expansion of system of sewerage and rain water networks to serve all areas in Tartous city especially its industrial area, it was not associated with proper wastewater treatment including the separation of rainwater from sewage and
building wastewater treatment plants. With the increased number of factories in the industrial area , the population growth in the city of Tartous, the demand for industrial needs, the poor investment for networks, the clogged lines and insulting them by mixing municipal, industrial and rainwater sewage and large precipitation for Tartous city Basin, and the difficulty of discharging wastewater according with gravity to the treatment plant And the lack of possibility to drain rain water with large flows, the study of the current situation of municipal, industrial and rainwater sewage to develop solutions for it.
