Constrained Upstream

This project is a re-opening of an old paper that Martin drafted in 2018. The work covers the upstream relation in graphs. We define this notion for edges:

Given a graph G and a vertex set of controllers C and of sources S, an edge in G is called upstream if it is part of a simple path from S to C.

In this repository, especially the implementation is living, which is a glue of quite a few libraries and snippets that are a bit tricky to understand without knowing all of the history of the code.

This README aims at explaining essentially this: what is where and why.

Analysis

• Explanation starts with docs/main.md

This main uses the

• load function to load the dataset
• buildGraph function to build a graph

The core is, however,

• the Search Engine
• followed by the base algorithm docs/basealgorithm.md

Datasets

• Sample Dataset 1 docs/sampledataset1.md