endVertices(DynkinDiagram) -- the vertices of a Dynkin diagram with at most one neighbor

Synopsis

• Function: endVertices

• Usage:

  connectedComponents(D)

• Inputs:
  • D, an instance of the type DynkinDiagram
• Outputs:
  • a list, containing the vertices of D whose removal does not disconnect any part of D. They can have at most one neighbor.

Description

i1 : R=rootSystemE(6)

o1 = RootSystem{...8...}

o1 : RootSystem

i2 : D=dynkinDiagram(R)

o2 = DynkinDiagram{{{3}, {}, {}, {}, {}}, {{4}, {}, {}, {}, {}}, {{1, 4}, {}, {}, {}, {}}, {{2, 3, 5}, {}, {}, {}, {}}, {{4, 6}, {}, {}, {}, {}}, {{5}, {}, {}, {}, {}}}

o2 : DynkinDiagram

i3 : endVertices(D)

o3 = set {1, 2, 6}

o3 : Set