Social network for travelers with layovers

A method of notifying members of a social network of upcoming overlapping layovers comprising:

• (aa) downloading at least one schedule from at least one pre-determined schedule system, each of the at least one schedule created by one of the at least one schedule system without direct input from the each member;
• (a) extracting layover data from the at least one schedule and determining at least one layover of a first member of a social network from the layover data, the social network having a social network database, the social network database including a list of members and for each of the members, the social network database including a list of buddy members of that member
• for each of the record in the schedules in which the person identifier corresponds with any member of a list of members of a social network, extracting at least one layover that comprise the any member, a layover location and a layover time period;
• the social network having a social network database, the social network database including the list of members and for each of the members, the social network database including a list of buddy members of that member;
• wherein the person identifier assist in uniquely identifying the records in the schedules with member of the any member of the list of members;
• (b) retrieving the list of the buddy members of the first member from the social network database;
• (c) extracting a current buddy from the list of buddy members of the first member;
• (d) searching the layover data for at least one layover of the current buddy and determining if the at least one layover of the current buddy overlaps with at least one layover of the first member;
• (e) if the searching finds an overlapping layover and the overlap is new or has changed, automatically notifying the first member and the current buddy of the overlapping layover;
• (f) repeating steps d and e until there are no more overlapping layovers;
• (g) if there exists a next current buddy in the list of buddy members of the first member:
• extracting a next current buddy from the list of buddy members of the first member, setting the current buddy to the next current buddy and repeating steps d through g.

A computer system providing a social network for traveling people, the social network comprising:

• a server computer;
• social network software executing on the server computer for providing social network functions, the social network software having a means for maintaining a list of members and, for each member, the social network software having a means for maintaining a list of buddies of the each member, the buddies also being in the list of members;
• at least one schedule, each of the at least one schedules downloaded from one or more pre-determined schedule systems, each of the at least one schedule created by the one or more schedule system without direct input from the each member, each schedule comprising a plurality of records, each of the records comprising a person identifier, at least one date/time, a source location, and a destination location;
• means for extracting layover data from the plurality of records;
• for each of the records in the schedules in which the person identifier corresponds with any member of the list of members, means for creating layover entries that comprise the any member, a layover location and a layover time period;
• wherein the person identifier assists in uniquely identifying the records in the schedules with the any member of the list of members;
• means for finding a member with a first layover in the layover data;
• means for finding a buddy of the member having a second layover;
• and
• means for automatically notifying the member of the overlapping layover if the first layover overlaps with the second layover when the overlapping layover is new or has changed.

Program instructions tangibly embodied in a non transitory storage medium comprising at least one instruction configured to implement a social network of upcoming overlapping layovers, wherein the at least one instruction comprises:

• (a0) computer readable instructions for downloading at least one schedule, each of the at least one schedule created by a pre-determined schedule system without direct input from the each member, each of the at least one schedules comprising a plurality of records, each of the records comprising a person identifier, at least one date/time, a source location, and a destination location;
• (a1) computer readable instructions for extracting layover data from the records in which the person identifier in the record corresponds with any member of the list of members, creating layover entries that comprise the any member, a layover location and a layover time period, wherein the person identifier assists in uniquely identifying the records in the schedules with the any member of the list of members;
• (a) computer readable instructions for searching the layover data for at least one layover of a first member of a social network, the social network having a social network database, the social network database including a list of members and for each of the members, the social network database including a list of buddy members, the schedule imported from an external source;
• (b) computer readable instructions for retrieving the list of the buddy members of the first member from the social network database;
• (c) computer readable instructions for extracting a current buddy from the list of buddy members of the first member;
• (d) computer readable instructions for searching the layover data for a set of layovers of the first member and a set of layovers of the current buddy and for finding an overlapping layover between the set of layovers of the current buddy and the set of layovers of the first member;
• (e) if an overlapping layover is found, computer readable instructions for notifying the first member and the current buddy of the overlapping layover if the overlap is new or has changed;
• (f) repeating steps d and e until there are no more overlapping layovers;
• (g) if there exists a next current buddy in the list of buddy members of the first member:
• computer readable instructions for extracting a next current buddy from the list of buddy members of the first member, setting the current buddy to the next current buddy and repeating steps d through g.