/home/r0/dav/atlas.dir/atlas3/sources/structure/dynkin.h File Reference

Class definitions and function declarations for DynkinDiagram. More...

#include <map>
#include "latticetypes_fwd.h"
#include "bitset.h"
#include "lietype.h"
#include "setutils.h"

Include dependency graph for dynkin.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	atlas
namespace	atlas::dynkin
Classes
class	atlas::dynkin::DynkinDiagram
	A Dynkin diagram of at most RANK_MAX vertices. More...
Typedefs
typedef std::pair< size_t, size_t >	Edge
typedef unsigned	Multiplicity
Functions
void	components (bitset::RankFlagsList &, const DynkinDiagram &, const bitset::RankFlags &)

---

Detailed Description

Class definitions and function declarations for DynkinDiagram.

Definition in file dynkin.h.

---

Typedef Documentation

typedef std::pair<size_t, size_t> atlas::dynkin::Edge

Since a Dynkin diagram will be a bitset (a subset of RANK_MAX elements, the possible vertices 0, 1,...,RANK_MAX-1), an Edge is a pair of numbers (between 0 and RANK_MAX-1). Definition at line 35 of file dynkin.h. Referenced by atlas::dynkin::DynkinDiagram::cartanEntry(), atlas::dynkin::DynkinDiagram::DynkinDiagram(), atlas::irreducibleType(), atlas::dynkin::DynkinDiagram::labelEdge(), atlas::typeBNormalize(), atlas::typeCNormalize(), atlas::typeFNormalize(), and atlas::typeGNormalize().

typedef unsigned atlas::dynkin::Multiplicity

The Multiplicity of an Edge should be 1, 2, or 3. Definition at line 40 of file dynkin.h. Referenced by atlas::dynkin::DynkinDiagram::edgeMultiplicity(), and atlas::dynkin::DynkinDiagram::maxMultiplicity().

---

Function Documentation

void components (  bitset::RankFlagsList &  , const DynkinDiagram &  , const bitset::RankFlags &  )

Referenced by atlas::interpreter::check_involution().

---