This repository contains a basic C program that calculates the shortest path between two cities in a map, using adjacency matrices and minimum heaps. The program reads from an input file to construct ...

Abstract: Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t path that ...

This paper considers the shortest path problem with waiting costs (SPWC) as an extension to the shortest path problem with time windows. The problem consists of finding the minimum cost path in a ...

1 Arrays & Strings Sliding Window Maintain a moving window (subarray/substring) for sum/unique chars problems. LC 53: Max Subarray, LC 3: Longest Substring Without Repeating Chars, LC 76: Minimum ...

Abstract: Graph encryption is a form of searchable encryption that enables a cloud server to handle private queries on graphs. Ghosh, Kamara, and Tamassia (ASIA CCS 2021) proposed the first graph ...