Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Breadth-first_search> ?p ?o }
Showing triples 1 to 55 of
55
with 100 triples per page.
- Breadth-first_search abstract "In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to visit the nodes that neighbor the currently visited node. The BFS begins at a root node and inspects all the neighboring nodes. Then for each of those neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on. Compare BFS with the equivalent, but more memory-efficient Iterative deepening depth-first search and contrast with depth-first search.".
- Breadth-first_search thumbnail Breadth-first-tree.svg?width=300.
- Breadth-first_search wikiPageExternalLink SECTION001531000000000000000.
- Breadth-first_search wikiPageExternalLink taocp.html.
- Breadth-first_search wikiPageExternalLink QQ1-46-92.
- Breadth-first_search wikiPageID "97026".
- Breadth-first_search wikiPageRevisionID "606050584".
- Breadth-first_search caption "Order in which the nodes are expanded".
- Breadth-first_search class Search_algorithm.
- Breadth-first_search complete "yes".
- Breadth-first_search data Graph_(abstract_data_type).
- Breadth-first_search hasPhotoCollection Breadth-first_search.
- Breadth-first_search optimal "yes".
- Breadth-first_search subject Category:Graph_algorithms.
- Breadth-first_search subject Category:Search_algorithms.
- Breadth-first_search type Abstraction100002137.
- Breadth-first_search type Act100030358.
- Breadth-first_search type Activity100407535.
- Breadth-first_search type Algorithm105847438.
- Breadth-first_search type Event100029378.
- Breadth-first_search type GraphAlgorithms.
- Breadth-first_search type Procedure101023820.
- Breadth-first_search type PsychologicalFeature100023100.
- Breadth-first_search type Rule105846932.
- Breadth-first_search type SearchAlgorithms.
- Breadth-first_search type YagoPermanentlyLocatedEntity.
- Breadth-first_search comment "In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to visit the nodes that neighbor the currently visited node. The BFS begins at a root node and inspects all the neighboring nodes. Then for each of those neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on.".
- Breadth-first_search label "Algorithme de parcours en largeur".
- Breadth-first_search label "Breadth-first search".
- Breadth-first_search label "Breadth-first search".
- Breadth-first_search label "Breitensuche".
- Breadth-first_search label "Busca em largura".
- Breadth-first_search label "Búsqueda en anchura".
- Breadth-first_search label "Przeszukiwanie wszerz".
- Breadth-first_search label "Ricerca in ampiezza".
- Breadth-first_search label "Поиск в ширину".
- Breadth-first_search label "幅優先探索".
- Breadth-first_search label "广度优先搜索".
- Breadth-first_search sameAs Prohledávání_do_šířky.
- Breadth-first_search sameAs Breitensuche.
- Breadth-first_search sameAs Búsqueda_en_anchura.
- Breadth-first_search sameAs Algorithme_de_parcours_en_largeur.
- Breadth-first_search sameAs Ricerca_in_ampiezza.
- Breadth-first_search sameAs 幅優先探索.
- Breadth-first_search sameAs 너비_우선_탐색.
- Breadth-first_search sameAs Breadth-first_search.
- Breadth-first_search sameAs Przeszukiwanie_wszerz.
- Breadth-first_search sameAs Busca_em_largura.
- Breadth-first_search sameAs m.0p0jb.
- Breadth-first_search sameAs Q325904.
- Breadth-first_search sameAs Q325904.
- Breadth-first_search sameAs Breadth-first_search.
- Breadth-first_search wasDerivedFrom Breadth-first_search?oldid=606050584.
- Breadth-first_search depiction Breadth-first-tree.svg.
- Breadth-first_search isPrimaryTopicOf Breadth-first_search.