vertex

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.

class Vertex a

OpenGL Graphics.Rendering.OpenGL.GL.VertexSpec

Specify the (x, y, z, w) coordinates of a four-dimensional vertex. This must only be done during renderPrimitive, otherwise the behaviour is unspecified. The current values of the auxiliary vertex attributes are associated with the vertex. Note that there is no such thing as a "current vertex" which could be retrieved.

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