vertex package:algebraic-graphs
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
Construct the graph comprising
a single isolated vertex.
vertex . Left == leftVertex
vertex . Right == rightVertex
Construct the graph with a single vertex.
Construct the graph comprising a single isolated vertex. An alias for
pure.
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
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
Construct the graph comprising
a single isolated vertex.
hasVertex x (vertex y) == (x == y)
vertexCount (vertex x) == 1
edgeCount (vertex x) == 0
The number of vertices in a graph. Complexity:
O(s * log(n))
time.
Good consumer.
vertexCount empty == 0
vertexCount (vertex x) == 1
vertexCount == length . vertexList
vertexCount x < vertexCount y ==> x < y
The sorted list of vertices of a given graph. Complexity:
O(s *
log(n)) time and
O(n) memory.
Good consumer of graphs and producer of lists.
vertexList empty == []
vertexList (vertex x) == [x]
vertexList . vertices == nub . sort
The number of vertices in a graph. Complexity:
O(1) time.
vertexCount empty == 0
vertexCount (vertex x) == 1
vertexCount == length . vertexList
vertexCount x < vertexCount y ==> x < y
The sorted list of vertices of a given graph. Complexity:
O(n)
time and memory.
vertexList empty == []
vertexList (vertex x) == [x]
vertexList . vertices == nub . sort
The number of vertices in a graph. Complexity:
O(1) time.
vertexCount empty == 0
vertexCount (vertex x) == 1
vertexCount == length . vertexList
vertexCount x < vertexCount y ==> x < y
The sorted list of vertices of a given graph. Complexity:
O(n)
time and memory.
vertexList empty == []
vertexList (vertex x) == [x]
vertexList . vertices == nub . sort