#1601 Add Single Source Earliest Arrival Operator

[niklaslkuhn]

Added an operator to calculate the single source earliest arrival times for a temporal graph.

Description

Add an operator that calculates the single source earliest arrival time for each vertex starting from a start node and a start time. A temporal graph is used as input. The following parameters are supported

• interval -> difference between interval and timestamp at edge
• overlap -> allow edges times to overlap

The output is a temporal graph with the earliest arrival times at the vertices.

Related Issue

#1601

Motivation and Context

Operator solves the single source earliest arrival problem

How Has This Been Tested?

Unit Tests with a test graph

Types of Changes

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to change)

Checklist:

• My code follows the code style of this project.
• I have updated the documentation accordingly (if necessary).
• I have added tests to cover my changes.
• All new and existing tests passed.
• I ran a spell checker.