LINE Solver (C++)
Templated C++ port of the LINE queueing solver
Loading...
Searching...
No Matches
line::spn::SpnSiphons Struct Reference

#include <line/api/spn/spn_siphons.h>

Collaboration diagram for line::spn::SpnSiphons:

Public Attributes

std::vector< std::size_t > places
 1-based node indices, in level order
std::vector< std::vector< int > > S
 one minimal siphon per row (0/1 over levels)
std::vector< bool > trapped
 largest trap inside S(i) is marked at m0
bool commoner = true
 every minimal siphon holds a marked trap
std::vector< long long > m0

Detailed Description

Definition at line 37 of file spn_siphons.h.

Member Data Documentation

◆ commoner

bool line::spn::SpnSiphons::commoner = true

every minimal siphon holds a marked trap

Definition at line 41 of file spn_siphons.h.

Referenced by line::spn::spn_properties(), and line::spn::spn_siphons().

◆ m0

std::vector<long long> line::spn::SpnSiphons::m0

Definition at line 42 of file spn_siphons.h.

Referenced by line::spn::spn_siphons().

◆ places

std::vector<std::size_t> line::spn::SpnSiphons::places

1-based node indices, in level order

Definition at line 38 of file spn_siphons.h.

Referenced by line::spn::spn_siphons().

◆ S

std::vector<std::vector<int> > line::spn::SpnSiphons::S

one minimal siphon per row (0/1 over levels)

Definition at line 39 of file spn_siphons.h.

Referenced by line::spn::spn_siphons().

◆ trapped

std::vector<bool> line::spn::SpnSiphons::trapped

largest trap inside S(i) is marked at m0

Definition at line 40 of file spn_siphons.h.

Referenced by line::spn::spn_siphons().


The documentation for this struct was generated from the following file: