Preview this item
Preview this item
Checking...

# About graphs and how a computer sees a graph

Author: Advait Jayant [Place of publication not identified] : Technics Publications, 2019. eVideo : Clipart/images/graphics : EnglishView all editions and formats "Advait Jayant explains the concept of graphs. A graph is a data structure which is represented as a finite set of nodes and edges. The nodes in a graph are called “vertices” and edges connect any two vertices. Explore graph use cases. Know the important graph concepts of adjacent, degree, in-degree, out-degree, path, connected graph, subgraph, connected component, tree, forest, and minimum spanning tree. Learn how each of these graph concepts is represented in computer memory. Learn the Edge List, Adjacency Matrix, and Adjacency List approaches to how a computer visualizes a graph."--Resource description page.  Read more... (not yet rated) 0 with reviews - Be the first.

## Find a copy in the library

Finding libraries that hold this item...

## Details

Material Type: Clipart/images/graphics, Internet resource, Videorecording Internet Resource, Computer File, Visual material Advait Jayant Find more information about: Advait Jayant 1111634324 Title from resource description page (Safari, viewed August 6, 2019). Presenter, Advait Jayant. 1 online resource (1 streaming video file (33 min., 18 sec.)) : digital, sound, color Advait Jayant.

### Abstract:

"Advait Jayant explains the concept of graphs. A graph is a data structure which is represented as a finite set of nodes and edges. The nodes in a graph are called “vertices” and edges connect any two vertices. Explore graph use cases. Know the important graph concepts of adjacent, degree, in-degree, out-degree, path, connected graph, subgraph, connected component, tree, forest, and minimum spanning tree. Learn how each of these graph concepts is represented in computer memory. Learn the Edge List, Adjacency Matrix, and Adjacency List approaches to how a computer visualizes a graph."--Resource description page.

## Reviews

User-contributed reviews

Be the first.

## Similar Items

### Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

### Primary Entity

<http://www.worldcat.org/oclc/1111634324> # About graphs and how a computer sees a graph
a schema:CreativeWork, schema:Movie, schema:VideoObject ;
library:oclcnum "1111634324" ;
rdfs:comment "Unknown 'gen' value: cig" ;
schema:about <http://experiment.worldcat.org/entity/work/data/9436362642#Topic/graph_algorithms> ; # Graph algorithms
schema:about <http://experiment.worldcat.org/entity/work/data/9436362642#Topic/charts_diagrams_etc> ; # Charts, diagrams, etc
schema:datePublished "2019" ;
schema:description ""Advait Jayant explains the concept of graphs. A graph is a data structure which is represented as a finite set of nodes and edges. The nodes in a graph are called “vertices” and edges connect any two vertices. Explore graph use cases. Know the important graph concepts of adjacent, degree, in-degree, out-degree, path, connected graph, subgraph, connected component, tree, forest, and minimum spanning tree. Learn how each of these graph concepts is represented in computer memory. Learn the Edge List, Adjacency Matrix, and Adjacency List approaches to how a computer visualizes a graph."--Resource description page."@en ;
schema:exampleOfWork <http://worldcat.org/entity/work/id/9436362642> ;
schema:inLanguage "en" ;
schema:name "About graphs and how a computer sees a graph"@en ;
schema:productID "1111634324" ;
schema:url <http://proquest.safaribooksonline.com/?fpi=9781634626132> ;
wdrs:describedby <http://www.worldcat.org/title/-/oclc/1111634324> ;
.

### Related Entities

a schema:Person ;
schema:familyName "Jayant" ;