Class Cycle

moduleexamples0.0.1

Search

Filter

Simple directed graph forming a cycle of n vertices numbered from 0 to n-1. REQUIRE: n > 0

By: ThorstenSeitz

Anything
- Object
  - Basic ...and other supertypes
    ImplicitAdjacencyGraph ...and other supertypes
    Cycle ...and other supertypes

Cycle
- ImplicitAdjacencyGraph
  - AdjacencyGraph
  - Basic
    Identifiable
    Object
    Anything
- VertexList
  - AdjacencyGraph

no subtypes hierarchy

Initializer
`Cycle(Integer n)` Parameters: `n` `n > 0`

Attributes
`empty`	Source Code`shared actual Boolean empty` Answer whether the graph is empty, i.e. contains no vertices. Refines `ImplicitAdjacencyGraph.empty` (`empty`) ultimately refines `AdjacencyGraph.empty` (`empty`)
`vertices`	Source Code`shared actual default {Integer}Go to Iterable abbreviation {X+} or {X} means Iterable<X,Nothing> or Iterable<X,Null> vertices` All vertices of the graph. Refines `VertexList.vertices` (`vertices`)

Inherited Attributes
Attributes inherited from: `Object` `Object.hash`, `Object.string`
Attributes inherited from: `AdjacencyGraph<V>` `empty`, `notEmpty`
Attributes inherited from: `VertexList<V>` `vertices`

Inherited Methods
Methods inherited from: `ImplicitAdjacencyGraph<V>` `bfsTraversal`, `neighbors`
Methods inherited from: `Object` `Object.equals()`
Methods inherited from: `AdjacencyGraph<V>` `containsEdge`, `degreeOf`, `forEachNeighbor`, `hasNeighbors`, `neighbors`
Methods inherited from: `VertexList<V>` `containsVertex`