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

Akash Shrivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationNanosynthesis and Nanodevice
Pages186-192
Number of pages7
DOIs
Publication statusPublished - 08-04-2013
Externally publishedYes
EventInternational Conference on Nanoscience and Nanotechnology 2011, NANO-SciTech 2011 - Shah Alam, Selangor, Malaysia
Duration: 02-03-201103-03-2011

Publication series

NameAdvanced Materials Research
Volume667
ISSN (Print)1022-6680

Conference

ConferenceInternational Conference on Nanoscience and Nanotechnology 2011, NANO-SciTech 2011
CountryMalaysia
CityShah Alam, Selangor
Period02-03-1103-03-11

Fingerprint

Computer applications
Directed graphs
Computer science
Computer program listings

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Shrivastava, A. (2013). Graph and its computer application with c++ using linked lists. In Nanosynthesis and Nanodevice (pp. 186-192). (Advanced Materials Research; Vol. 667). https://doi.org/10.4028/www.scientific.net/AMR.667.186
Shrivastava, Akash. / Graph and its computer application with c++ using linked lists. Nanosynthesis and Nanodevice. 2013. pp. 186-192 (Advanced Materials Research).
@inproceedings{ea6a7118fa734c7bb66edd4d917cf0f2,
title = "Graph and its computer application with c++ using linked lists",
abstract = "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.",
author = "Akash Shrivastava",
year = "2013",
month = "4",
day = "8",
doi = "10.4028/www.scientific.net/AMR.667.186",
language = "English",
isbn = "9783037856307",
series = "Advanced Materials Research",
pages = "186--192",
booktitle = "Nanosynthesis and Nanodevice",

}

Shrivastava, A 2013, Graph and its computer application with c++ using linked lists. in Nanosynthesis and Nanodevice. Advanced Materials Research, vol. 667, pp. 186-192, International Conference on Nanoscience and Nanotechnology 2011, NANO-SciTech 2011, Shah Alam, Selangor, Malaysia, 02-03-11. https://doi.org/10.4028/www.scientific.net/AMR.667.186

Graph and its computer application with c++ using linked lists. / Shrivastava, Akash.

Nanosynthesis and Nanodevice. 2013. p. 186-192 (Advanced Materials Research; Vol. 667).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

SN - 9783037856307

T3 - Advanced Materials Research

SP - 186

EP - 192

BT - Nanosynthesis and Nanodevice

ER -

Shrivastava A. Graph and its computer application with c++ using linked lists. In Nanosynthesis and Nanodevice. 2013. p. 186-192. (Advanced Materials Research). https://doi.org/10.4028/www.scientific.net/AMR.667.186