This project used to find the shortest path in the network

"Two techiniques for finding shortest path" is a IEEE project and i giva a sample code for that project.

This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.

对复杂网络进行建模,分析网络属性（最短路径、集聚系数、度数分布、核数）。-Complex network model, analyze network properties (shortest path, clustering coefficient, degree distribution, auditing).