隣接リスト
1. Adjacency listIn graph theory, an adjacency list is the representation of all edges or arcs in a graph as a list. If the graph is undirected, every entry is a set of two nodes containing the two ends of the corresponding edge; if it is directed, every entry is a tuple of two nodes, one denoting the source node and the other denoting the destination node of the corresponding arc. Typically, adjacency lists are unordered.
Read “Adjacency list” on English Wikipedia
Read “隣接リスト” on Japanese Wikipedia
Read “Adjacency list” on DBpedia
Read “Adjacency list” on English Wikipedia
Read “隣接リスト” on Japanese Wikipedia
Read “Adjacency list” on DBpedia
Discussions
Log in to talk about this word.