A graph is a data structure consisting of ____/vertices and pointers/____. A graph differs from a linked list and binary tree because each vertex can have more than ____ edges and point to any vertex in the data structure. The edges can either:​ point in one direction (directed graph); or​ not specify a direction (____ graph). Graphs can also be ____ (or unweighted), with each edge given a value representing a relationship between the vertices – like ____, for example. ​ We typically store graphs as objects or using a ____, known as ____ lists. However, we can also store graphs using an array, known as an adjacency ____, with rows and columns representing vertices and edges respectively. Graphs have many uses in computer science – for example:​ Mapping road networks for ____ systems or storing social network data.​

Graph Data Structure

さんの投稿です
印刷
埋め込み

リーダーボード

表示スタイル

オプション

テンプレートを切り替える

自動保存: を復元しますか?