ring method

Graph<V, E> ring({
  1. required int vertexCount,
})

Implementation

Graph<V, E> ring({required int vertexCount}) {
  final graph = empty();
  if (vertexCount <= 0) {
    return graph;
  }
  addVertexIndex(graph, 0);
  for (var i = 1; i < vertexCount; i++) {
    addEdgeIndex(graph, i - 1, i);
  }
  if (vertexCount != 1) {
    addEdgeIndex(graph, vertexCount - 1, 0);
  }
  return graph;
}