超立方体图-yiteyi-C++库

如果输入的是n阶图（连接到节点的边的最大数量），则必须在n阶超立方体图中找到顶点的数量。

null

例如：

Input : n = 3
Output : 8

Input : n = 2
Output : 4

推荐：请尝试你的方法 {IDE} 首先，在进入解决方案之前。

在超立方体图Q（n）中，n表示图的阶数。超立方体图表示可以连接到一个图以使其成为n度图的最大边数，每个顶点具有相同的n度，在该表示中，只添加固定数量的边和顶点，如下图所示：

Hypercube Graph

所有超立方体图都是哈密顿图， n阶超立方体图有（2^n）个顶点， ，对于输入n作为图的阶数，我们必须找到相应的2的幂。

C++

                         // C++ program to find vertices in a hypercube                       
                         // graph of order n                       
                         #include <iostream>                       
                         using                                     namespace                                     std;                       
                                   
                         // function to find power of 2                       
                         int                                     power(                                     int                                     n)                       
                         {                       
                                                 if                                     (n == 1)                       
                                                 return                                     2;                       
                                                 return                                     2 * power(n - 1);                       
                         }                       
                                   
                         // driver program                       
                         int                                     main()                       
                         {                       
                                                 // n is the order of the graph                       
                                                 int                                     n = 4;                       
                                                 cout << power(n);                       
                                                 return                                     0;                       
                         }                       

JAVA

                         // Java program to find vertices in                       
                         // a hypercube graph of order n                       
                         class                                     GfG                       
                         {                       
                                   
                                                 // Function to find power of 2                       
                                                 static                                     int                                     power(                                     int                                     n)                       
                                                 {                       
                                                 if                                     (n ==                                     1                                     )                       
                                                 return                                     2                                     ;                       
                                                 return                                     2                                     * power(n -                                     1                                     );                       
                                                 }                       
                                   
                                                 // Driver program                       
                                                 public                                     static                                     void                                     main(String []args)                       
                                                 {                       
                                   
                                                 // n is the order of the graph                       
                                                 int                                     n =                                     4                                     ;                       
                                                 System.out.println(power(n));                       
                                                 }                       
                         }                       
                                   
                         // This code is contributed by Rituraj Jain                       

Python3

                         # Python3 program to find vertices in a hypercube                       
                         #  graph of order n                       
                                   
                         # function to find power of 2                       
                         def                                     power(n):                       
                                                 if                                     n                                     =                                     =                                     1                                     :                       
                                                 return                                     2                       
                                                 return                                     2                                     *                                     power(n                                     -                                     1                                     )                       
                                   
                                   
                         # Dricer code                       
                         n                                     =                                     4                       
                         print                                     (power(n))                       
                                   
                                   
                         # This code is contributed by Shrikant13                       

C#

                         // C# program to find vertices in                       
                         // a hypercube graph of order n                       
                         using                                     System;                       
                                   
                         class                                     GfG                       
                         {                       
                                   
                                                 // Function to find power of 2                       
                                                 static                                     int                                     power(                                     int                                     n)                       
                                                 {                       
                                                 if                                     (n == 1)                       
                                                 return                                     2;                       
                                                 return                                     2 * power(n - 1);                       
                                                 }                       
                                   
                                                 // Driver code                       
                                                 public                                     static                                     void                                     Main()                       
                                                 {                       
                                   
                                                 // n is the order of the graph                       
                                                 int                                     n = 4;                       
                                                 Console.WriteLine(power(n));                       
                                                 }                       
                         }                       
                                   
                         // This code is contributed by Mukul Singh                       

PHP

                         <?php                       
                         // PHP program to find vertices in                       
                         // a hypercube graph of order n                       
                         {                       
                                   
                                                 // Function to find power of 2                       
                                                 function                                     power(                                     $n                                     )                       
                                                 {                       
                                                 if                                     (                                     $n                                     == 1)                       
                                                 return                                     2;                       
                                                 return                                     2 * power(                                     $n                                     - 1);                       
                                                 }                       
                                   
                                                 // Driver Code                       
                                                 {                       
                                   
                                                 // n is the order of the graph                       
                                                 $n                                     = 4;                       
                                                 echo                                     (power(                                     $n                                     ));                       
                                                 }                       
                         }                       
                                   
                         // This code is contributed by Code_Mech                       
                         ?>                       

Javascript

                         <script>                       
                                   
                                   
                         // Javascript program to find vertices in a hypercube                       
                         // graph of order n                       
                                   
                         // function to find power of 2                       
                         function                                     power(n)                       
                         {                       
                                                 if                                     (n == 1)                       
                                                 return                                     2;                       
                                                 return                                     2 * power(n - 1);                       
                         }                       
                                   
                         // driver program                       
                         // n is the order of the graph                       
                         var                                     n = 4;                       
                         document.write( power(n));                       
                                   
                         </script>                       

输出：

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章