Skip to content

raphlcc/separating-path-system-certifier

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

separating-path-system-certifier

To test whether any given list of paths separates a set of edges, this project provides a simple implementation that verifies if a collection of paths forms a separating path system.

Running the example code

To run the example code, execute the following command:

python ./sample_example.py

Usage

First, import the strongly_separates function:

from src.certifier import strongly_separates

Then, define the graph by specifying its edge set and a separating system:

edges = {(1, 2), (2, 3)}
system = [[1, 2], [2, 3]]

print(strongly_separates(edges, system))

In this example, for a graph $𝐺$, the separating system used is exactly the edge set $𝐸(𝐺)$, viewed as a collection of trivial paths.

About

A simple certifier from instances of the Separating Path System problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages