Q = toricQuiver E
Q = toricQuiver (E, F)
Q = toricQuiver M
Q = toricQuiver (M, F)
Q = toricQuiver G
Q = toricQuiver (G, F)
Q = toricQuiver T
Q = toricQuiver (T, F)
A toric quiver is a directed graph Q=(Q_0, Q_1) where Q_0 is the set of vertices associated to Q and Q_1 is the set of arrows. Also included in $Q$ is a flow, which associates an integer value to each edge. The canonical flow gives a weight of 1 to each edge.
The ToricQuiver data type is stored as a hash table with the following keys:
|
|
|
|
|
|
|
|
|
|
The object toricQuiver is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/ThinSincereQuivers.m2:3279:0.