C/C++

Simple ATM Simulation

Submitted by harvey.rosero on
This is my first code submission on this community, a Simple Automated Teller Machine (ATM) System made in C++ Features: - Account Name and PIN Code - Check Balance - Transfer Funds to other accounts - Deposit Transaction - Withdraw Transaction - Printing Receipt - Password Masking using asterisk - Time Delay - ASCII Code for great ui Login Details Account :221215 Pincode: 221215 Feel free to

Testing Directed or Undirected Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Directed or undirected graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Testing Weighted or Unweighted Graph From Given Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Weighted or unweighted graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

Check Number of Isolated Vertices & Pendent Vertices from Adjacency Matrix

Submitted by Arup Kr Goswami on
This is a simple C source code written in gcc paltform (Ubuntu, Linux). It checks that how many Isolated vertices & pendent vertices are contained in the graph represented by the adjacency matrix. Isolated vertex has degree zero & pendent vertex has degree one. Hope it will help others. Thanks.

Check Number of Self-loop & Parallel Edges From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests that how many self-loop & parallel edges are contained in the graph represented by the adjacency matrix. Also it checks that which vertices contain only self-loop. Self-loop is an edge which has the same initial & termination point.

Testing Regular Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Regular Graph or not. Basically a Regular graph is a graph, in which all vertices have equal degree. Let each & every vertex has degree x, then the graph is called as x-regular graph.

Testing Complete Graph From Adjacency Matrix

Submitted by Arup Kr Goswami on
Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Complete Graph or not. Actually This reads a text file, Adjacency.txt & then checks the above condition. Please correct the path of Adjacency.txt in the code. Thanks.

Simple ATM Simulation

Submitted by harvey.rosero on
Hello folks this is my first post in sourcecodester, This simple application simulate with ATM Transaction developed in Dev C++. Program Features: 1 - Log In Account 2 - Withdrawal 3 - Deposit 4 - Check Balance 5 - Log Out i used some functions like masking the password with asterisk, printing features and ascii code for a more presentable ui, if you interested to enhance the project feel free to