Pinned Loading

1. myfirstrepo myfirstrepo Public

   This repo contain my first project's code.

   HTML

2. faizan.adoc faizan.adoc

   1

   = Neo4j: International Flights Database:neo4j-version: 2.3.0:Writer: Arsalan Masood & Muhammad Faizan Hameed:twitter: @your_twitter_Faizan9990:style: red:Person(Arsalan)

   2

   // Please use the style & syntax-help outlined here: https://github.com/neo4j-contrib/graphgist/blob/master/gists/syntax.adoc// This is also a good example for a GraphGist: https://gist.github.com/jexp/2014efa6448b307c65e9

   3

   == Introduction

   4

   Description: Most people are looking for the best possible flight options when traveling from one destination to another. However the "best possible flight option" can be defined based on different criteria, such as ticket prices, number of stops, travel time, operating airline, and etc. which each is built upon quite a few. Although this problem may seem very similar to finding the shortest path within a given graph, there is a distinct matter that should be taken care of, in which in travels that has a stop in between, we only can select those flights that their departure time falls after previous flight’s arrival time (in addition of minimum time buffer). While there are many websites that offer such a service, I modeled this scenario using GraphGist.

   5

   What my proposal has to offer which distinguishes it from many other available programs, is that in this model, in addition to travelers, other type of entities are addressed such as organizing systems of airports, airlines, and other agencies to have a better understanding of statistics of different airlines, popularity of destinations, and demographics of their users per any defined period of time. Thus these data can be used for better and more efficient proposed plans by organizations..

3. gistfile1.txt gistfile1.txt

   1

   Rubies are red, +

   2

   Topazes are blue.

   3

   [%hardbreaks]

   4

   Ruby is red.

   5

   Java is black.