Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q264398> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Q264398 subject Q8498905.
- Q264398 abstract "In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.".
- Q264398 thumbnail Simple_cycle_graph.svg?width=300.
- Q264398 wikiPageExternalLink 960201.html.
- Q264398 wikiPageExternalLink 12_2_AdjacencyLists_Graph_a.html.
- Q264398 wikiPageExternalLink graph.
- Q264398 wikiPageWikiLink Q1304193.
- Q264398 wikiPageWikiLink Q131476.
- Q264398 wikiPageWikiLink Q141488.
- Q264398 wikiPageWikiLink Q186152.
- Q264398 wikiPageWikiLink Q207440.
- Q264398 wikiPageWikiLink Q21198.
- Q264398 wikiPageWikiLink Q243754.
- Q264398 wikiPageWikiLink Q2479726.
- Q264398 wikiPageWikiLink Q3017847.
- Q264398 wikiPageWikiLink Q3085841.
- Q264398 wikiPageWikiLink Q30942.
- Q264398 wikiPageWikiLink Q383444.
- Q264398 wikiPageWikiLink Q44337.
- Q264398 wikiPageWikiLink Q7003418.
- Q264398 wikiPageWikiLink Q727035.
- Q264398 wikiPageWikiLink Q787903.
- Q264398 wikiPageWikiLink Q79872.
- Q264398 wikiPageWikiLink Q8498905.
- Q264398 wikiPageWikiLink Q893105.
- Q264398 comment "In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.".
- Q264398 label "Adjacency list".
- Q264398 depiction Simple_cycle_graph.svg.