modulegraph0.0.1
Source Code
graph
interfaceEdge<Vertex, E>
of DirectedEdge<Vertex,E> | UndirectedEdge<Vertex,E>
given Vertex satisfies Object
given E satisfies Edge<Vertex,E>
OverviewPackageAttributesMethods

A generic edge between two vertices of type Vertex.

By: ThorstenSeitz

no type hierarchy

no supertypes hierarchy

Attributes
isDirectedSource Codeshared formal Boolean isDirected

Whether the edge is directed.

Source Codeshared Boolean isLink

Answer whether the edge is a link between two different vertices.

isLoopSource Codeshared Boolean isLoop

Answer whether the edge is a loop, i.e. source == target.

reversedSource Codeshared formal E reversed
selfSource Codeshared E self
sourceSource Codeshared formal Vertex source

The source vertex of the edge.

targetSource Codeshared formal Vertex target

The target vertex of the edge.

Inherited Attributes
Attributes inherited from: Object
Object.hash, Object.string
Methods
isEndpointSource Codeshared Boolean isEndpoint(Vertex vertex)
isIncidentSource Codeshared formal Boolean isIncident(Vertex vertex)
otherEndSource Codeshared Vertex otherEnd(Object endpoint)

Given one endpoint of the edge answer its other endpoint.

Parameters:
  • endpoint
    • endpoint == source || endpoint == target
Inherited Methods
Methods inherited from: Object
Object.equals()