Index
All Classes and Interfaces|All Packages
A
- addEdge(UEdge<A>) - Method in class model.graph.UGraph
-
Returns a new
UGraphwith the specifiededgeadded.
C
- complete(Set<A>) - Static method in class model.graph.UGraph
-
Constructs the complete undirected graph on the given set of vertices.
- cycle(List<A>) - Static method in class model.graph.UGraph
-
Constructs the cycle graph from a list
vertices[v1, v2,..., vn] such that there is an edge between each two consecutive vertices in the list and an edge, {vn, v1}, between the last vertex and the first vertex in the list.
D
- degree(A) - Method in class model.graph.UGraph
-
Returns the degree of vertex
v. - degreeSequence() - Method in class model.graph.UGraph
-
Returns the non-increasing degree sequence of the graph as a list.
E
- edges() - Method in class model.graph.UGraph
-
Returns the set of edges in the simple undirected graph.
- edgesCount() - Method in class model.graph.UGraph
-
Returns the number of edges in the graph.
- equals(Object) - Method in record class model.graph.UEdge
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in class model.graph.UGraph
F
- fromEdges(Set<UEdge<A>>) - Static method in class model.graph.UGraph
-
Constructs a new simple undirected from a set of undirected edges.
G
- Graph<A> - Interface in model.graph
H
- hasEdge(A, A) - Method in class model.graph.UGraph
-
Returns
trueif the graph contains an edge between vertexvand vertexu. - hashCode() - Method in record class model.graph.UEdge
-
Returns a hash code value for this object.
- hashCode() - Method in class model.graph.UGraph
I
- incidencesCount() - Method in class model.graph.UGraph
-
Returns the number of incidences in the graph.
M
- model.graph - package model.graph
N
- neighbours(A) - Method in class model.graph.UGraph
-
Returns the set of vertices that are adjacent to vertex
v.
P
- path(List<A>) - Static method in class model.graph.UGraph
-
Constructs the path graph from a list
vertices[v1, v2,..., vn] such that there is an edge between each two consecutive vertices in the list.
R
- removeEdge(UEdge<A>) - Method in class model.graph.UGraph
-
Returns a new
UGraphwithout the specifiededge. - removeVertex(A) - Method in class model.graph.UGraph
-
Returns a new
UGraphwith the specified vertexvremoved.
S
- star(Set<A>, A) - Static method in class model.graph.UGraph
-
Constructs the star graph with one central vertex adjacent to all other vertices in a given set of vertices and a centre vertex
- subdivideEdge(A, UEdge<A>) - Method in class model.graph.UGraph
-
Returns a new
UGraphwith the specified vertexwadded in such a way that it subdivides the specifiededgeinto two new edges by placing the specified vertexwin between the end vertices of the specifiededge.
T
- toString() - Method in record class model.graph.UEdge
-
Returns a string representation of this record class.
- toString() - Method in class model.graph.UGraph
U
- u() - Method in record class model.graph.UEdge
-
Returns the value of the
urecord component. - UEdge<A> - Record Class in model.graph
-
A representation of an undirected edge on a simple undirected graph.
- UEdge(A, A) - Constructor for record class model.graph.UEdge
-
Constructs an undirected edge between the vertices
uandvboth of type<A>. - UGraph<A> - Class in model.graph
-
A representation of a simple undirected graph.
- UGraph(Set<A>, Set<UEdge<A>>) - Constructor for class model.graph.UGraph
-
Constructs a new simple undirected graph from a set of vertices and undirected edges.
V
- v() - Method in record class model.graph.UEdge
-
Returns the value of the
vrecord component. - vertices() - Method in class model.graph.UGraph
-
Returns the set of vertices in the simple undirected graph.
- verticesCount() - Method in class model.graph.UGraph
-
Returns the number of vertices in the graph.
All Classes and Interfaces|All Packages