Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: single-source shortest path

Sortuj według:

Ogranicz wyniki do:

Parallel hierarchies for solving single source shortest path problem

Chomątek Ł.

Journal of Applied Computer Science

2013

Vol. 21, nr 1

25--38

The problem of route optimization is significant due to the fact of the high availablity of private transport as well as the need of efficient utilization of the corporate fleet. Optimal route can have different meaning for different users. In the existing algorithms designed for finding optimal route between two points on the map, hardly any preferences are reflected. In this article we present efficient algorithm for finding optimal route between points on the map which is designed to conforms Users’ needs.

Lazy shortest path computation in dynamic graphs

Aioanei D.

Computer Science

2012

Vol. 13 (3)

113-137

We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously reported to be the fastest one in various conditions, resulting in important time savings that we demonstrate for the problem of incremental path map construction in usersteered image segmentation. Moreover, we extend the idea of lazy shortest path computation to digraphs subjected to both edge weight increases and decreases, comparing favourably to the fastest recent state-of-the-art algorithm.