vertex -package:OpenGL

vertex :: a -> Graph a
algebraic-graphs Algebra.Graph
Construct the graph comprising a single isolated vertex. An alias for the constructor Vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
size        (vertex x) == 1
vertex :: a -> AdjacencyMap a
algebraic-graphs Algebra.Graph.Acyclic.AdjacencyMap Algebra.Graph.AdjacencyMap
Construct the graph comprising a single isolated vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: Int -> AdjacencyIntMap
algebraic-graphs Algebra.Graph.AdjacencyIntMap
Construct the graph comprising a single isolated vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: Either a b -> AdjacencyMap a b
algebraic-graphs Algebra.Graph.Bipartite.AdjacencyMap
Construct the graph comprising a single isolated vertex. 
vertex . Left  == leftVertex
vertex . Right == rightVertex
vertex :: Graph g => Vertex g -> g
algebraic-graphs Algebra.Graph.Class
Construct the graph with a single vertex.
vertex :: Graph g => a -> g a
algebraic-graphs Algebra.Graph.HigherKinded.Class
Construct the graph comprising a single isolated vertex. An alias for pure.
vertex :: a -> Graph e a
algebraic-graphs Algebra.Graph.Labelled
Construct the graph comprising a single isolated vertex. An alias for the constructor Vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: a -> AdjacencyMap e a
algebraic-graphs Algebra.Graph.Labelled.AdjacencyMap
Construct the graph comprising a single isolated vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: a -> Graph a
algebraic-graphs Algebra.Graph.NonEmpty
Construct the graph comprising a single isolated vertex. An alias for the constructor Vertex. 
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
size        (vertex x) == 1
vertex :: a -> AdjacencyMap a
algebraic-graphs Algebra.Graph.NonEmpty.AdjacencyMap
Construct the graph comprising a single isolated vertex. 
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: a -> Relation a
algebraic-graphs Algebra.Graph.Relation Algebra.Graph.Relation.Symmetric
Construct the graph comprising a single isolated vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
vertex :: a -> Graph a
algebraic-graphs Algebra.Graph.Undirected
Construct the graph comprising a single isolated vertex. 
isEmpty     (vertex x) == False
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount   (vertex x) == 0
size        (vertex x) == 1
type Vertex = Int
containers Data.Graph, cabal-install-solver Distribution.Solver.Modular.LabeledGraph
Abstract representation of vertices.
data Vertex
sdl2 SDL.Raw.Types SDL.Video.Renderer
Vertex :: FPoint -> Color -> FPoint -> Vertex
sdl2 SDL.Raw.Types SDL.Video.Renderer
module Graphics.GL.SUN.Vertex
OpenGLRaw
Vertex :: a -> Graph a
algebraic-graphs Algebra.Graph Algebra.Graph.NonEmpty
type family Vertex g
algebraic-graphs Algebra.Graph.Class
Vertex :: a -> Graph e a
algebraic-graphs Algebra.Graph.Labelled
module Graphics.GL.Ext.SUN.Vertex
gl
class (Element v) => Vertex v
greskell Data.Greskell Data.Greskell.Graph
org.apache.tinkerpop.gremlin.structure.Vertex interface in a TinkerPop graph.
data Vertex
gogol-vision Gogol.Vision Gogol.Vision.Types
A vertex represents a 2D point in the image. NOTE: the vertex coordinates are in the same scale as the original image. See: newVertex smart constructor.
Vertex :: Maybe Int32 -> Maybe Int32 -> Vertex
gogol-vision Gogol.Vision Gogol.Vision.Types
vertexNames :: Lens (StrokeOpts a) (StrokeOpts a') [[a]] [[a']]
diagrams-lib Diagrams.TwoD Diagrams.TwoD.Path
Atomic names that should be assigned to the vertices of the path so that they can be referenced later. If there are not enough names, the extra vertices are not assigned names; if there are too many, the extra names are ignored. Note that this is a list of lists of names, since paths can consist of multiple trails. The first list of names are assigned to the vertices of the first trail, the second list to the second trail, and so on. The default value is the empty list.
vertexAttribCoord3 :: SettableStateVar (Maybe AttribLocation)
GLUT Graphics.UI.GLUT.State
(freeglut only) If vertexAttribCoord3 and vertexAttribNormal both contain Nothing, the fixed function pipeline is used to draw objects. Otherwise VBOs are used and the coordinates are passed via Just this attribute location (for a vec3).