We consider the problem of finding paths in a network between two certain nodes, when some criteria like cheep, fast, wide, reliable etc. have been posed. The problems stated below, are multicriteria and are solved by means of lexicographical ordering of the criteria. The proposed algorithms are polynomial ones,