GitHub

Dijkstra's algorithm VS Parallel delta-stepping

The delta-stepping algorithm, introduced by Meyer and Sanders (2000), is a parallel-friendly variant of Dijkstra’s algorithm for the single-source shortest path problem. It works by dividing edges ...
GitHub

Graphs and Graph Algorithms in C++

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above ...
IEEE

A Performance Evaluation of A* and Dijkstra Algorithms with Visual-Based Goal Selection

Abstract: Successful operation of autonomous robots in complex environments require both reliable perception and efficient path planing. Reliable perception provide ...
IEEE

Actuarial Risk Assessment and Pricing Optimization Algorithm Based on Graph Neural Network

Abstract: In this study, we proposed a new method combining graph sampling aggregation network (GraphSAGE), Contrastive Learning (CL) and Bayesian Optimization. First, GraphSAGE was used to model the ...