From b6cdd049bf80eedb18a3802527bbdc21da1d1775 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=C3=84min=20Baumeler?= Date: Mon, 11 Sep 2023 12:22:12 +0200 Subject: [PATCH] Fixed indent in function descriptions --- src/SOCadmissible.c | 8 ++++---- src/SOCgen.c | 12 ++++++------ 2 files changed, 10 insertions(+), 10 deletions(-) diff --git a/src/SOCadmissible.c b/src/SOCadmissible.c index a1bf59c..15ca328 100644 --- a/src/SOCadmissible.c +++ b/src/SOCadmissible.c @@ -9,10 +9,10 @@ /*** * Read graphs from file. - * Input `filename': string - * Input `cnt': pointer to int - * Input `maxdim': pointer to int - * Output: pointer to graph data + * Input `filename': string + * Input `cnt': pointer to int + * Input `maxdim': pointer to int + * Output: pointer to graph data * * This function sets `cnt' to the total number of graphs read from `filename', * sets `maxdim' to the dimension (number of nodes) of the largest graph, diff --git a/src/SOCgen.c b/src/SOCgen.c index 9265369..81b24c2 100644 --- a/src/SOCgen.c +++ b/src/SOCgen.c @@ -302,13 +302,13 @@ int find_cycles(int *cycles, int *cyclescnt, int n, const int *children, \ /*** * gissoc tests wheter the graph provided is a SOC or not. - * Parameter `n': Number of nodes - * Parameter `parents': Pointer to list of parents per node - * Parameter `parentslen': Pointer to list of number of parents per node - * Parameter `children': Pointer to list of children per node + * Parameter `n': Number of nodes + * Parameter `parents': Pointer to list of parents per node + * Parameter `parentslen': Pointer to list of number of parents per node + * Parameter `children': Pointer to list of children per node * Parameter `childrenlen': Pointer to list of number of children per node - * Parameter `cycles': Pointer to list of cycles in the graph - * Parameter `cyclescnt': Pointer to list of cycles count + * Parameter `cycles': Pointer to list of cycles in the graph + * Parameter `cyclescnt': Pointer to list of cycles count * * This function retruns 0 if the graph is NOT a SOC, and 1 otherwise. *