This project will help you to easily monitor activities or projects by using this angular-gantt chart. This gantt chart has many options or features so you can easily manage the projects and tasks. Read the documentation here and here's for the demo application.

In this project we are going to learn how to create tic-tac-toe game in javascript. This will entertain you and your visitors from your website. Here's the complete javascript code for this game. Have Fun! TIC TAC TOE GAME TIC TAC TOE GAME Hope this will help you.

In this project we are going to learn how to disable copy and paste. You can't prevent stealing your content but you can make it more difficult for people to copy the contents of your website. Here's a script that will disable Copy and Paste.

Okay, i just finished programing a new droid adventure game. I got source codes from internet, pasted them on python, personalized everything, made a few changes in story, and VOILA! Here it is! Droids adventure game! Just copy the source code to your python shell, then run the module. Hope you have fun!

SASS and CSS We use SASS and Bourbon (http://bourbon.io/) for our resources. If you don't use SASS, just use the .css files that you find in the css folder. You can delete both sass and partials folders. Instructions: Just run on your normal desktop browsers & mobile browsers tool. Thanks & Enjoy. Hope you like it. I am happy if like my codes

In this project, I have two main modules. One for customer and another one is admin. Admin can add bus details with price, root, etc. And also it manage the customer requests. Just try this yourself and I'm sure this code will help you.

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.

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.

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.

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.