The Dijkstra and Hoare monads have been introduced recently for capturing weakest precondition computations and computations with preand post-conditions, within the context of program verification, supported by a theorem prover. Here we give a more general description of such monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a trian...

Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm, on account of the insufficiency of this algorithm in path optimization, this paper uses adjacency list and circular linked list with combination to store date, and through the improv...

Consider the single-source cheapest paths problem in a digraph with negative edge costs allowed. A hybrid of Bellman-Ford and Dijkstra algorithms is suggested, improving the running time bound upon Bellman-Ford for graphs with a sparse distribution of negative cost edges. The algorithm iterates Dijkstra several times without reinitializing values d(v) at vertices. At most k+2 executions of Dijk...

In this paper, we present Dijkstra-WSA, a novel graph-based algorithm for word sense alignment. We evaluate it on four different pairs of lexical-semantic resources with different characteristics (WordNet-OmegaWiki, WordNet-Wiktionary, GermaNet-Wiktionary and WordNet-Wikipedia) and show that it achieves competitive performance on 3 out of 4 datasets. Dijkstra-WSA outperforms the state of the ar...

Nearest close friend query (k?NCF) in geo-social networks, aims to find the k nearest user objects from among ?-hop friends of user. Existing efforts on k?-NCF Euclidean space. In this paper, we study problem road-social networks.We propose two methods. One is based Dijkstra algorithm, and other ISLabel. For Dijkstra-based method, algorithm used traverse needed. label-based make use IS-Label ca...

Based on a generic program for computing minimal sets, we present a simple relational program for computing transitive reductions of strongly connected directed graphs. It uses a precomputation phase and can easily be implemented in quadratic running time. The presentation is done as an exercise in generic programming and for combining the Dijkstra-Gries method and relational algebra to derive ...

In this paper, we study the problem of finding the shortest path in a polygonal domain in which the path should meet (touch or cross) a simple polygon in the domain. Our method uses the continuous Dijkstra paradigm and the idea of wavelet reflection and solves the problem in worst-case optimal time O(n log n).

Trajectory modeling is foundational for 4D-Route modeling, conflict detection and air traffic flow management. This paper proposes a novel algorithm based Vincenty’s fomulas for trajectory calculation, combined with the Dijkstra algorithm and Vincenty’s formulas. Using flight plan simulations our experimental results show that our method of En-route trajectory calculation exhibits much improved...

Several special-purpose systems have been proposed to analyze programs in JavaScript and other dynamically typed languages. However, none of these prior systems support automated, modular verification for both higher-order and stateful features. This paper proposes a new refinement of the state monad, the Dijkstra state monad, as a way of structuring specifications for higher-order, stateful pr...