TY - GEN

T1 - Graph and its computer application with c++ using linked lists

AU - Shrivastava, Akash

PY - 2013/4/8

Y1 - 2013/4/8

N2 - An effort is made to develop a computer programme using C++ to explain the working ofa adjacency linked-list representation of a directed graph or digraph and explain the allocation ofdata using C++. The program uses the concept of arranging a graph in the form of a linked list forthe computer to understand the graphical form representation of any data. The graph algorithms area significant field of interest within computer science. Typical higher level operations associatedwith graphs are; finding a path between two nodes, like depth-first search and breadth-first searchand finding the shortest path from one node to another, like Dijkstra's algorithm. A solution tofinding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm. A directed graph can be seen as a flow network, where each edge has acapacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out themaximum flow from a source to a sink in a graph. Conversion of a graph into a computer storabledigital data is useful for nanodevices.

AB - An effort is made to develop a computer programme using C++ to explain the working ofa adjacency linked-list representation of a directed graph or digraph and explain the allocation ofdata using C++. The program uses the concept of arranging a graph in the form of a linked list forthe computer to understand the graphical form representation of any data. The graph algorithms area significant field of interest within computer science. Typical higher level operations associatedwith graphs are; finding a path between two nodes, like depth-first search and breadth-first searchand finding the shortest path from one node to another, like Dijkstra's algorithm. A solution tofinding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm. A directed graph can be seen as a flow network, where each edge has acapacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out themaximum flow from a source to a sink in a graph. Conversion of a graph into a computer storabledigital data is useful for nanodevices.

UR - http://www.scopus.com/inward/record.url?scp=84875690749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875690749&partnerID=8YFLogxK

U2 - 10.4028/www.scientific.net/AMR.667.186

DO - 10.4028/www.scientific.net/AMR.667.186

M3 - Conference contribution

AN - SCOPUS:84875690749

SN - 9783037856307

T3 - Advanced Materials Research

SP - 186

EP - 192

BT - Nanosynthesis and Nanodevice

T2 - International Conference on Nanoscience and Nanotechnology 2011, NANO-SciTech 2011

Y2 - 2 March 2011 through 3 March 2011

ER -