modulegraph0.0.1
Source Code
graph
interfaceSimpleGraph<V, E>
satisfies IncidenceGraph<V,E>
given V satisfies Object
given E satisfies Edge<V,E>
OverviewPackageAttributesMethods

A SimpleGraph contains at most one undirected or two directed (but opposite) edges between any two vertices.

By: ThorstenSeitz

no type hierarchy

no subtypes hierarchy

Inherited Attributes
Attributes inherited from: Object
Object.hash, Object.string
Attributes inherited from: AdjacencyGraph<V>
AdjacencyGraph.empty, AdjacencyGraph.notEmpty
Attributes inherited from: IncidenceGraph<V,E>
IncidenceGraph.edges
Methods
adjacentEdgesSource Codeshared actual default {E*} adjacentEdges(V vertex)

The adjacent edges of the given vertex. A directed edge is adjacent if it is outgoing. The edges are answered such that the following conditions hold:

   edge.source == vertex
   neighbors(vertex).contains(edge.target)
Refines IncidenceGraph.adjacentEdges
edgeConnectingSource Codeshared formal E? edgeConnecting(V source, V target)

Answer the edge between the given vertices if it exists. If an edge is answered then the following conditions hold:

edge.source == source
edge.target == target
Inherited Methods
Methods inherited from: Object
Object.equals()
Methods inherited from: AdjacencyGraph<V>
AdjacencyGraph.containsEdge(), AdjacencyGraph.degreeOf(), AdjacencyGraph.forEachNeighbor(), AdjacencyGraph.hasNeighbors(), AdjacencyGraph.neighbors()
Methods inherited from: IncidenceGraph<V,E>
IncidenceGraph.adjacentEdges(), IncidenceGraph.forEachAdjacentEdge()