57 explicit BruhatOrder(
const std::vector<set::EltList>& Hasse_diagram)
58 : d_hasse(Hasse_diagram), d_poset(0) {}
63 size_t size()
const {
return d_hasse.size(); }
const poset::Poset & poset()
Returns the full poset relation.
Definition: bruhat.h:82
BruhatOrder(const std::vector< set::EltList > &Hasse_diagram)
Definition: bruhat.h:57
poset::Poset d_poset
Poset relation.
Definition: bruhat.h:52
Intended to represent the Bruhat order on K orbits on G/B, or on a block of representations.
Definition: bruhat.h:37
Represents a poset by the matrix of order relations.
Definition: poset.h:39
void fillPoset()
Computes the full poset from the stored Hasse diagram.
Definition: bruhat.cpp:32
size_t size() const
Definition: bruhat.h:63
const set::EltList & hasse(size_t x) const
Returns row |x| of the Hasse diagram for the order.
Definition: bruhat.h:67
std::vector< Elt > EltList
Definition: Atlas.h:53
unsigned long n_comparable_from_Hasse(const std::vector< set::EltList > &hasse)
Definition: poset.cpp:225
unsigned long n_comparable() const
Returns the number of comparable pairs in the order.
Definition: bruhat.h:74
std::vector< set::EltList > d_hasse
Hasse diagram for a Bruhat order.
Definition: bruhat.h:45