commit 035d047f00cfd5659b2f8d3c660d40bb8a6af97c
parent c81c319276c778ed8056c153d71ea07aea19b841
Author: Andrew Laack <andrew@laack.co>
Date: Wed, 16 Sep 2026 11:08:53 -0500
fmt
Diffstat:
1 file changed, 8 insertions(+), 9 deletions(-)
diff --git a/src/main.cpp b/src/main.cpp
@@ -32,10 +32,10 @@ int main(int argc, char** argv) {
.default_value(DEFAULT_SLEEP_TIME)
.scan<'g', float>();
- // edges != total number of unique edges in all cases where uniqueness is defined by
- // vertices this is because we allow multiple edges between two vertices
- // (though they aren't rendered differently) we don't allow self-edges
- // though.
+ // edges != total number of unique edges in all cases where uniqueness is
+ // defined by vertices this is because we allow multiple edges between two
+ // vertices (though they aren't rendered differently) we don't allow
+ // self-edges though.
program.add_argument("--edges", "-e")
.help("number of edges in the graph")
@@ -54,24 +54,23 @@ int main(int argc, char** argv) {
std::size_t edgeCount = program.get<std::size_t>("--edges");
float sleepTime = program.get<float>("--sleep");
- if(sleepTime < 0) {
+ if (sleepTime < 0) {
std::cout << "Sleep time must be >= 0." << std::endl;
return -1;
}
- if(vertexCount == 0) {
+ if (vertexCount == 0) {
std::cout << "Vertex count must be >= 1" << std::endl;
return -1;
}
- if(edgeCount == 0) {
+ if (edgeCount == 0) {
std::cout << "Edge count must be >= 1" << std::endl;
return -1;
}
- if(edgeCount > 0 && vertexCount <= 1) {
+ if (edgeCount > 0 && vertexCount <= 1) {
std::cout << "Not enough vertices to create any edges." << std::endl;
return -1;
}
-
SetTraceLogLevel(LOG_ERROR);
auto ss = getScreenSize();