Loading [MathJax]/extensions/tex2jax.js
Parallel numerical verification of the σ_odd problem  October 6, 2018
All Classes Namespaces Files Functions Variables Typedefs Macros
dot.hpp
Go to the documentation of this file.
1 /* -*- coding: latin-1 -*- */
2 /** \file common/sigmaodd/dot.hpp (January 2, 2018)
3  * \brief
4  * To produce graph DOT file.
5  *
6  * GPLv3 --- Copyright (C) 2017, 2018 Olivier Pirson
7  * http://www.opimedia.be/
8  */
9 
10 #ifndef PROGS_SRC_COMMON_SIGMAODD_DOT_HPP_
11 #define PROGS_SRC_COMMON_SIGMAODD_DOT_HPP_
12 
13 #include "divisors.hpp"
14 
15 
16 namespace sigmaodd {
17 
18  /* ***********
19  * Prototype *
20  *************/
21 
22  /** \brief
23  * Print to std::cout in a DOT format,
24  * a graph of path of the sigma odd problem.
25  *
26  * If show_node
27  * then plot nodes with number,
28  * else plot only points.
29  *
30  * If shortcut
31  * then do not print bigger step,
32  * else print complete path until 1.
33  *
34  * If circular
35  * then plot circular graph,
36  * else plot tree graph.
37  *
38  * See https://en.wikipedia.org/wiki/DOT_(graph_description_language)
39  *
40  * @param first odd
41  * @param last
42  * @param show_node
43  * @param shortcut
44  * @param circular
45  */
46  void
47  print_varsigmaodd_dot(nat_type first, nat_type last, bool show_node = true,
48  bool shortcut = false, bool circular = false);
49 
50 } // namespace sigmaodd
51 
52 #endif // PROGS_SRC_COMMON_SIGMAODD_DOT_HPP_
unsigned long nat_type
Type for natural number used in all code, on 64 bits.
Definition: sigmaodd.cl:22
A lot of functions and stuffs to deal the sigma_odd problem and related stuffs.
Definition: divisors.cpp:22
void print_varsigmaodd_dot(nat_type first, nat_type last, bool show_node, bool shortcut, bool circular)
Print to std::cout in a DOT format, a graph of path of the sigma odd problem.
Definition: dot.cpp:76
Functions in link with divisor notion: sum of divisors, factorization, GCD, coprime, ...