15 17. Ctypes

data structures

Count Vowels – Enter a string and the program counts the variety of vowels in the text. For added complexity have it report a sum of every vowel found. Reverse a String – Enter a string and this system will reverse it and print it out. Connected Graph – Create a program which takes a graph as an enter and outputs whether or not every node is related or not. Eulerian Path – Create a program which is able to take as an enter a graph and output either a Eulerian path or a Eulerian cycle, or state that it is not possible.

17 1.6. Calling Capabilities With Your Individual Custom Knowledge Varieties¶

A Eulerian Path begins at one node and traverses each edge of a graph through every node and finishes at one other node. A Eulerian cycle is a eulerian Path that begins and finishes on the identical … Read More