Djikstra + Bitwise OR

Правка en1, от JonTyrell, 2017-07-28 12:41:31

Let's say there is a directed graph with weighted edges and the distance from one vertex to another is defined as the bitwise OR of the edges in the path.Can we apply djikstra for single source shortest path here ?

Теги djikstra, bitwise or

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский JonTyrell 2017-07-28 12:41:31 235 Initial revision (published)