mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-21 21:11:57 +03:00
Code Issues Packages Projects Releases Wiki Activity

added safety paranthesis

Browse Source
This commit is contained in:
Krishna Vedala 2020-06-16 12:33:41 -04:00
parent 580c501c29
commit 2651ff5903
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
2 changed files with 14 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
machine_learning/kohonen_som_topology.c
View File

@ -28,10 +28,12 @@
#endif
#ifndef max
#define max(a, b) (a > b ? a : b) /**< shorthand for maximum value */
#define max(a, b) (((a) > (b)) ? (a) : (b)) /**< shorthand for maximum value \
*/
#endif
#ifndef min
#define min(a, b) (a < b ? a : b) /**< shorthand for minimum value */
#define min(a, b) (((a) < (b)) ? (a) : (b)) /**< shorthand for minimum value \
*/
#endif
/** to store info regarding 3D arrays */

13
machine_learning/kohonen_som_trace.c
View File

@ -9,8 +9,9 @@
* The algorithm creates a connected network of weights that closely
* follows the given data points. This this creates a chain of nodes that
* resembles the given input shape.
* \see kohonen_som_topology.c
*/
#define _USE_MATH_DEFINES // required for MS Visual C
#define _USE_MATH_DEFINES /**< required for MS Visual C */
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
@ -19,8 +20,14 @@
#include <omp.h>
#endif
#define max(a, b) (a > b ? a : b) // shorthand for maximum value
#define min(a, b) (a < b ? a : b) // shorthand for minimum value
#ifndef max
#define max(a, b) (((a) > (b)) ? (a) : (b)) /**< shorthand for maximum value \
*/
#endif
#ifndef min
#define min(a, b) (((a) < (b)) ? (a) : (b)) /**< shorthand for minimum value \
*/
#endif
/**
* Helper function to generate a random number in a given interval.