This HTML5 document contains 84 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
n22http://dbpedia.org/resource/PL/
dbohttp://dbpedia.org/ontology/
n17http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
dbpedia-pthttp://pt.dbpedia.org/resource/
dbpedia-cshttp://cs.dbpedia.org/resource/
n11http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Doubly_linked_list
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
dbr:C_data_types
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
dbr:Data_structure
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
dbr:Linked_data_structure
rdf:type
yago:Structure105726345 yago:PsychologicalFeature100023100 yago:Arrangement105726596 yago:Cognition100023271 yago:WikicatDataStructures yago:Abstraction100002137 dbo:Building yago:DataStructure105728493
rdfs:label
Estrutura de dados vinculada Linked data structure Zřetězené datové struktury
rdfs:comment
Zřetězená datová struktura je v programech taková struktura, která obsahuje soubor záznamů (uzlů), které jsou mezi sebou propojené pomocí referencí (odkazy nebo ukazateli). Hlavním rozdílem mezi zřetězenou datovou strukturou a nezřetězenou je tedy to, že ve zřetězené musí být u každého prvku odkaz na další prvek/prvky v sekvenci, zatímco v nezřetězené struktuře probíhá přístup k dalšímu prvku pomocí dopočítání adresy v paměti. Em ciência da computação, uma estrutura de dados vinculada ou estrutura de dados ligada é uma estrutura de dados que consiste em um conjunto de registros de dados (nós) ligados entre si e organizados por referências (links ou ponteiros). A ligação entre dados também pode ser chamada de conector. Estruturas de dados vinculadas incluem listas ligadas, árvores de pesquisa, árvores de expressão, e muitas outras estruturas amplamente utilizadas. Elas são os blocos de construção para muitos algoritmos eficientes, tais como ordenação topológica e o Disjoint. In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers). The link between data can also be called a connector. Linking can be done in two ways – using dynamic allocation and using array index linking. Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort and set union-find.
foaf:depiction
n11:Singly-linked-list.svg n11:Single_node1.svg
dct:subject
dbc:Abstract_data_types dbc:Trees_(data_structures) dbc:Linked_lists
dbo:wikiPageID
22474945
dbo:wikiPageRevisionID
1077118457
dbo:wikiPageWikiLink
dbr:Cache_(computing) dbr:Data_structure dbr:Search_tree dbr:Topological_sort dbr:Locality_of_reference dbr:Contiguity_(computer_science) dbr:Disjoint-set_data_structure dbr:Dynamic_memory_allocation dbr:Successor_(graph_theory) dbr:Virtual_memory dbc:Abstract_data_types dbr:Typedef dbr:Linked_list dbr:Data_type dbr:In-order_traversal dbr:Theoretical_computer_science dbr:Structure dbr:Dynamic_data_structures dbr:Random_access_machine dbr:Pointer_(computer_programming) dbr:Expression_tree dbr:Node_(computer_science) n17:Single_node1.svg n17:Singly-linked-list.svg dbc:Trees_(data_structures) dbr:Middleware dbr:List_of_data_structures dbr:Computer_science dbc:Linked_lists dbr:Best,_worst_and_average_case dbr:Pointer_machine dbr:Thread_(computing) dbr:Ordered_set dbr:Process_(computing) dbr:Array_data_structure dbr:Reference_(computer_science) dbr:Record_(computer_science)
owl:sameAs
dbpedia-pt:Estrutura_de_dados_vinculada freebase:m.05zz143 dbpedia-sr:Повезана_структура_података n18:4qbSN wikidata:Q6554356 dbpedia-cs:Zřetězené_datové_struktury
dbp:wikiPageUsesTemplate
dbt:Snd dbt:Reflist dbt:Data_structures
dbo:thumbnail
n11:Singly-linked-list.svg?width=300
dbo:abstract
Zřetězená datová struktura je v programech taková struktura, která obsahuje soubor záznamů (uzlů), které jsou mezi sebou propojené pomocí referencí (odkazy nebo ukazateli). Hlavním rozdílem mezi zřetězenou datovou strukturou a nezřetězenou je tedy to, že ve zřetězené musí být u každého prvku odkaz na další prvek/prvky v sekvenci, zatímco v nezřetězené struktuře probíhá přístup k dalšímu prvku pomocí dopočítání adresy v paměti. In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers). The link between data can also be called a connector. In linked data structures, the links are usually treated as special data types that can only be dereferenced or compared for equality. Linked data structures are thus contrasted with arrays and other data structures that require performing arithmetic operations on pointers. This distinction holds even when the nodes are actually implemented as elements of a single array, and the references are actually array indices: as long as no arithmetic is done on those indices, the data structure is essentially a linked one. Linking can be done in two ways – using dynamic allocation and using array index linking. Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort and set union-find. Em ciência da computação, uma estrutura de dados vinculada ou estrutura de dados ligada é uma estrutura de dados que consiste em um conjunto de registros de dados (nós) ligados entre si e organizados por referências (links ou ponteiros). A ligação entre dados também pode ser chamada de conector. Estruturas de dados vinculadas incluem listas ligadas, árvores de pesquisa, árvores de expressão, e muitas outras estruturas amplamente utilizadas. Elas são os blocos de construção para muitos algoritmos eficientes, tais como ordenação topológica e o Disjoint.
gold:hypernym
dbr:Structure
prov:wasDerivedFrom
wikipedia-en:Linked_data_structure?oldid=1077118457&ns=0
dbo:wikiPageLength
7926
foaf:isPrimaryTopicOf
wikipedia-en:Linked_data_structure
Subject Item
n22:I
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
dbr:Connector_(computer_science)
dbo:wikiPageWikiLink
dbr:Linked_data_structure
dbo:wikiPageRedirects
dbr:Linked_data_structure
Subject Item
dbr:Record_(computer_science)
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
dbr:Reference_(computer_science)
dbo:wikiPageWikiLink
dbr:Linked_data_structure
Subject Item
wikipedia-en:Linked_data_structure
foaf:primaryTopic
dbr:Linked_data_structure