Font Size: a A A

The Contact Management System Based On Dijkstra’s Algorithm

Posted on:2013-04-27Degree:MasterType:Thesis
Country:ChinaCandidate:C LiFull Text:PDF
GTID:2248330395459591Subject:Software engineering
Abstract/Summary:PDF Full Text Request
Contact management system keeps the contact information of a large number ofusers while the shared contact management system saves the contact information ofmany users with mutual trust. Within the scope of permissions, the necessaryinformation mining of all the users’ information, and the establishment ofcorresponding mathematical model and the adoption of the algorithm appropriate forthis model can help work out the shortest path from a user to the whole contacts. Itcan also help accurately and efficiently extend the contact and yield twice the resultwith half the effort.Targeted at the problems, such as the lack or the weakening of contact expansionin function, the existing insecurity problems despite the contact expansion achievedby SNS site, the paper applies the Dijkstra’s algorithm to the field of contactexpansion, designs and implements contact management system based on theDijkstra’s algorithm.This paper first analyzes the characteristics of the existing contact managementsystem and SNS site in the contact management and points out the shortcomings inthe contact expansion. It then conducts the mathematical modeling of contactexpansion and defines it as the problem of seeking shortest single-source path in thegraph. It also proposes the method of contact expansion based on the Dijkstra’salgorithm. Based on the records of the contact information, this method can helpobtain the shortest path either from a user to all the other users or from a user to aspecific user. In order to apply the Dijkstra’s algorithm to the contact expansion, thepaper designs the algorithm GHEN, which can generate contact graph through thecontact records, and points out how to apply the Dijkstra’s algorithm to realize thecomprehensive contact expansion and the expansion of specific contact. In order toensure the safety of the contact information, the paper divides the users into a threecategories: administrators, expansion users and ordinary users, and strictly set limits to the privileges of all kinds of users. The user’s contact information is only availableto the user himself and other users can’t get access to it. In the contact expansion, theexpansion user can only see the shortest path extended to all the contacts. Besides,this path only provides the contact name and other contact information is notaccessible.Based on it, the paper designs the contact management system that makespossible the application of this method to contact expansion. Firstly, it analyzes thesystematic needs, then makes the overall design of the system, divides functionalmodules and makes database design and system process design. The designed systemincludes five modules: contact management, management of contact circles, contactexpansion, user management and system backup. The system adopts B/S frameworkand applies the technologies developed by Java Web (JSP technology, Servlettechnology, Ajax technology, Hibernate technology) and MySql database to realize.After the test, the system fully meets the design objectives, has friendly interface,with stable operation and good response from the user after the trial. Theabove-mentioned contact management system has many functions, including contactmanagement, contact circle management, user management, system backup whichrealize efficient management of contact resources. Besides, the unique contactexpansion function can help users accurately and efficiently extend contact resources,and greatly broaden the user’s social intercourse, thus gaining the consistent praisefrom the users.
Keywords/Search Tags:Contact Management System, Contact Expansion, Dijkstra’s Algorithm
PDF Full Text Request
Related items