| 摘要 |
<p>The vertices in a constructed graph, are associated with route segments (L1-L5) of spatial route and are interconnected in pairs by arcs representing the transition between wavelength available at two consecutive vertices. The length of each arc is set corresponding to cost allocated to wavelength transition. The shortest path is determined from graph using an algorithm, based on the set length of arcs.</p> |
