What Is This?

This is an HTML+RDFa representation of metadata describing this Web-addressable resource.

Why Is This Important?

The property (attributes and values pairs) links on this page unveil a different kind of link, one which enables the following on HTTP networks such as the Web:

  1. Unambiguous identity for entities (aka. strong identifiers)
  2. Implicit binding of an entity and its metadata via strong identifiers
  3. Multiple metadata representations that enable a variety of presentations
  4. High precision Search and Find queries that simply use the metadata documents (by referencing entity URIs) as the query's Data Source Name

How Do I Discover Alternative Metadata Representations?

This document exposes metadata in the following formats: (X)HTML+RDFa, Turtle, N3, RDF/JSON, or RDF/XML. In the most basic form, you can simply view the (X)HTML source markup of this page, and go directly to the <head/> section which contains a <link/> tag with relationship and type properties for each format.

In addition, you can also explicitly request a desired metadata representation for a given resource via HTTP GET requests that use the entity's strong identifier as the call target.

How Can I Expose My Web Resources In This Manner?

Simply include the following in the <head/> section of your (static or dynamically generated) (X)HTML page:

<link rel="alternate" title="My Data in RDF Linked Data form"
type="application/rdf+xml"
href="http://linkeddata.uriburner.com/about/id/<this-page-URL>/>"

How Is This Related To The Linked Data Meme?

As stated above, the links in this page expose strong identifiers for its primary topic, secondary topics, attributes, and some values. These links, via implicit association, act as conduits to their metadata-bearing documents, in a variety formats.

[OpenLink Software]

About: Depth-first search - Wikipedia

An Entity of Type : Thing, from Data Source : https://en.wikipedia.org/wiki/Depth-first_search, within Data Space : dev.restore.ovi.cnr.it:8890

  • References
  • Referenced By
content

og:image
  • https://upload.wikimedia.org/wikipedia/commons/thumb/1/1f/Depth-first-tree.svg/800px-Depth-first-tree.svg.png
  • https://upload.wikimedia.org/wikipedia/commons/thumb/1/1f/Depth-first-tree.svg/640px-Depth-first-tree.svg.png
  • https://upload.wikimedia.org/wikipedia/commons/thumb/1/1f/Depth-first-tree.svg/1200px-Depth-first-tree.svg.png
og:image:height
  • 410
  • 513
  • 769
og:image:width
  • 800
  • 1200
  • 640
og:title
  • Depth-first search - Wikipedia
og:type
  • website
Title
  • Depth-first search - Wikipedia
links to
  • https://en.wikipedia.org/wiki/Category:Articles_containing_video_clips
  • https://en.wikipedia.org/wiki/CiteSeerX_(identifier)
  • https://en.wikipedia.org/wiki/Rajeev_Motwani
  • https://en.wikipedia.org/wiki/Commonwealth_realms
  • https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning
  • https://en.wikipedia.org/wiki/B*
  • https://en.wikipedia.org/wiki/Iterator
  • https://en.wikipedia.org/wiki/Reverse_Polish_notation
  • https://en.wikipedia.org/wiki/Tree_data_structure
  • https://en.wikipedia.org/wiki/Special:BookSources/0-201-89683-4
  • https://en.wikipedia.org/wiki/Graph_theory
  • https://en.wikipedia.org/wiki/Vertex_(graph_theory)
  • https://en.wikipedia.org/wiki/Shortest_path_problem
  • https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing
  • https://ca.wikipedia.org/wiki/Cerca_en_profunditat
  • https://en.wikipedia.org/wiki/Minimum_spanning_tree
  • https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm
  • https://en.wikipedia.org/wiki/Prim%27s_algorithm
  • https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
  • https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
  • https://en.wikipedia.org/wiki/Graph_(data_structure)
  • https://en.wikipedia.org/wiki/Search_algorithm
  • https://wikimediafoundation.org/
  • https://donate.wikimedia.org/?wmf_sour..._campaign=en.wikipedia.org&uselang=en
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
  • https://foundation.wikimedia.org/wiki/...uage/Policy:Universal_Code_of_Conduct
  • https://developer.wikimedia.org
  • https://stats.wikimedia.org/#/en.wikipedia.org
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement
  • https://www.mediawiki.org/
  • https://en.wikipedia.org/wiki/Wikipedia:Verifiability
  • https://en.wikipedia.org/wiki/Help:Referencing_for_beginners
  • https://en.wikipedia.org/wiki/Help:Maintenance_template_removal
  • https://en.wikipedia.org/wiki/ISBN_(identifier)
  • https://en.wikipedia.org/wiki/Doi_(identifier)
  • https://en.wikipedia.org/wiki/Category...escription_is_different_from_Wikidata
  • https://en.wikipedia.org/wiki/Category...rticles_needing_additional_references
  • https://en.wikipedia.org/wiki/S2CID_(identifier)
  • https://en.wikipedia.org/wiki/OCLC_(identifier)
  • https://en.wikipedia.org/wiki/Hdl_(identifier)
  • https://en.wikipedia.org/wiki/Johnson%27s_algorithm
  • https://en.wikipedia.org/wiki/Thomas_H._Cormen
  • https://en.wikipedia.org/wiki/Sample_(statistics)
  • https://en.wikipedia.org/wiki/Memory_management
  • https://en.wikipedia.org/wiki/Tree_(data_structure)
  • https://en.wikipedia.org/wiki/Analysis_of_algorithms
  • https://en.wikipedia.org/wiki/Main_Page
  • https://en.wikipedia.org/wiki/Wikipedia:Contents
  • https://en.wikipedia.org/wiki/Portal:Current_events
  • https://en.wikipedia.org/wiki/Special:Random
  • https://en.wikipedia.org/wiki/Wikipedia:About
  • https://en.wikipedia.org/wiki/Wikipedia:Contact_us
  • https://en.wikipedia.org/wiki/Help:Contents
  • https://en.wikipedia.org/wiki/Help:Introduction
  • https://en.wikipedia.org/wiki/Wikipedia:Community_portal
  • https://en.wikipedia.org/wiki/Special:RecentChanges
  • https://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard
  • https://en.wikipedia.org/wiki/Special:Search
  • https://en.wikipedia.org/wiki/Special:MyContributions
  • https://en.wikipedia.org/wiki/Special:MyTalk
  • https://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard
  • https://en.wikipedia.org/wiki/Special:SpecialPages
  • https://en.wikipedia.org/wiki/Artificial_intelligence
  • https://en.wikipedia.org/wiki/ISSN_(identifier)
  • https://en.wikipedia.org/wiki/Help:Category
  • https://en.wikipedia.org/wiki/Category:Articles_with_short_description
  • https://en.wikipedia.org/wiki/Wikipedi...-ShareAlike_4.0_International_License
  • https://en.wikipedia.org/wiki/Wikipedia:General_disclaimer
  • https://en.wikipedia.org/wiki/Category:Commons_category_link_is_on_Wikidata
  • https://en.wikipedia.org/wiki/ArXiv_(identifier)
  • https://en.wikipedia.org/wiki/Bibcode_(identifier)
  • https://en.wikipedia.org/wiki/Strongly_connected_components
  • https://en.wikipedia.org/wiki/Donald_Knuth
  • https://en.wikipedia.org/wiki/Time_complexity
  • https://en.wikipedia.org/wiki/Category:Articles_with_example_pseudocode
  • https://en.wikipedia.org/wiki/John_Hopcroft
  • https://en.wikipedia.org/wiki/Robert_Tarjan
  • https://en.wikipedia.org/wiki/Best,_worst_and_average_case
  • https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
  • https://en.wikipedia.org/wiki/Parse_tree
  • https://en.wikipedia.org/wiki/Bias
  • https://en.wikipedia.org/wiki/Category..._additional_references_from_July_2010
  • https://en.wikipedia.org/wiki/Algorithm
  • https://en.wikipedia.org/wiki/Directed_acyclic_graph
  • https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
  • https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
  • https://en.wikipedia.org/wiki/A*_search_algorithm
  • https://en.wikipedia.org/wiki/%C3%89va_Tardos
  • https://www.wikimedia.org/
  • https://en.wikipedia.org/wiki/Polish_notation
  • https://en.wikipedia.org/wiki/Space_complexity
  • https://en.wikipedia.org/wiki/Pat_Morin
  • https://en.wikipedia.org/wiki/Kurt_Mehlhorn
  • https://en.wikipedia.org/wiki/Peter_Sanders_(computer_scientist)
  • https://en.wikipedia.org/wiki/Patrice_Ossona_de_Mendez
  • https://en.wikipedia.org/wiki/Breadth-first_search
  • https://en.wikipedia.org/wiki/Depth-first_search
  • https://en.wikipedia.org/wiki/MR_(identifier)
  • https://en.wikipedia.org/wiki/Connected_component_(graph_theory)
  • https://en.wikipedia.org/wiki/Maze
  • https://en.wikipedia.org/wiki/Control-flow_graph
  • https://en.wikipedia.org/wiki/Branching_factor
  • https://ja.wikipedia.org/wiki/%E6%B7%B...5%E5%84%AA%E5%85%88%E6%8E%A2%E7%B4%A2
  • https://en.wikipedia.org/wiki/Tree_(data_structure)#Terminology
  • https://en.wikipedia.org/wiki/Journal_of_the_ACM
  • https://ecommons.cornell.edu/bitstream/1813/6011/1/73-165.pdf
  • https://doi.org/10.1145%2F321850.321852
  • https://hdl.handle.net/1813%2F6011
  • https://api.semanticscholar.org/CorpusID:6279825
  • https://en.wikipedia.org/wiki/Biconnected_graph
  • https://en.wikipedia.org/wiki/Halting_problem
  • https://en.wikipedia.org/wiki/Group_(mathematics)
  • https://en.wikipedia.org/wiki/Monte_Carlo_tree_search
  • https://en.wikipedia.org/wiki/Heuristics
  • https://en.wikipedia.org/wiki/Limit_set
  • https://en.wikipedia.org/wiki/Tree_traversal
  • https://en.wikipedia.org/wiki/Edge_(graph_theory)
  • https://en.wikipedia.org/wiki/Degree_(graph_theory)
  • https://en.wikipedia.org/wiki/Decision_problem
  • https://en.wikipedia.org/wiki/Parallel_algorithm
  • https://en.wikipedia.org/wiki/Introduction_to_Algorithms
  • https://en.wikipedia.org/wiki/Graph_traversal
  • https://en.wikipedia.org/wiki/Topological_sorting
  • https://en.wikipedia.org/wiki/Best-first_search
  • https://en.wikipedia.org/wiki/Planarity_testing
  • https://en.wikipedia.org/wiki/Beam_search
  • https://en.wikipedia.org/wiki/David_Karger
  • https://en.wikipedia.org/wiki/Bidirectional_search
  • https://en.wikipedia.org/wiki/Fringe_search
  • https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search
  • https://en.wikipedia.org/wiki/Jump_point_search
  • https://en.wikipedia.org/wiki/Lexicographic_breadth-first_search
  • https://en.wikipedia.org/wiki/Parallel_breadth-first_search
  • https://en.wikipedia.org/wiki/Reverse-delete_algorithm
  • https://en.wikipedia.org/wiki/Yen%27s_algorithm
  • https://en.wikipedia.org/wiki/Roberto_Tamassia
  • https://en.wikipedia.org/wiki/Michael_T._Goodrich
  • https://en.wikipedia.org/wiki/Iterative_deepening_A*
  • https://en.wikipedia.org/wiki/SMA*
  • https://en.wikipedia.org/wiki/P-complete
  • https://en.wikipedia.org/wiki/Charles_E._Leiserson
  • https://en.wikipedia.org/wiki/Ronald_L._Rivest
  • https://en.wikipedia.org/wiki/Clifford_Stein
  • https://en.wikipedia.org/wiki/NC_(complexity)
  • https://en.wikipedia.org/wiki/Pierre_Rosenstiehl
  • https://en.wikipedia.org/wiki/Special:BookSources/0-262-03293-7
  • https://ru.wikipedia.org/wiki/%D0%9F%D...3%D0%BB%D1%83%D0%B1%D0%B8%D0%BD%D1%83
  • https://en.wikipedia.org/wiki/Jon_Kleinberg
  • https://en.wikipedia.org/wiki/Lifelong_Planning_A*
  • https://en.wikipedia.org/wiki/D*
  • https://en.wikipedia.org/wiki/Category:Graph_algorithms
  • https://en.wikipedia.org/wiki/Combinatorica
  • https://en.wikipedia.org/wiki/Shimon_Even
  • https://en.wikipedia.org/wiki/Category:Search_algorithms
  • https://en.wikipedia.org/wiki/Depth-first_search#Output_of_a_depth-first_search
  • https://doi.org/10.1016%2F0020-0190%2885%2990024-9
  • https://en.wikipedia.org/wiki/Depth-first_search#bodyContent
  • https://en.wikipedia.org/w/index.php?t...teAccount&returnto=Depth-first+search
  • https://en.wikipedia.org/w/index.php?t...UserLogin&returnto=Depth-first+search
  • https://en.wikipedia.org/wiki/Depth-first_search#
  • https://en.wikipedia.org/wiki/Depth-first_search#Properties
  • https://en.wikipedia.org/wiki/Depth-first_search#Example
  • https://en.wikipedia.org/wiki/Depth-first_search#Vertex_orderings
  • https://en.wikipedia.org/wiki/Depth-first_search#Pseudocode
  • https://en.wikipedia.org/wiki/Depth-first_search#Applications
  • https://en.wikipedia.org/wiki/Depth-first_search#Complexity
  • https://en.wikipedia.org/wiki/Depth-first_search#See_also
  • https://en.wikipedia.org/wiki/Depth-first_search#Notes
  • https://en.wikipedia.org/wiki/Depth-first_search#References
  • https://en.wikipedia.org/wiki/Depth-first_search#External_links
  • https://ar.wikipedia.org/wiki/%D8%A7%D...%D9%82_%D8%A7%D9%84%D8%A3%D9%88%D9%84
  • https://bg.wikipedia.org/wiki/%D0%9E%D...B%D0%B1%D0%BE%D1%87%D0%B8%D0%BD%D0%B0
  • https://bar.wikipedia.org/wiki/Diafnsuach
  • https://cs.wikipedia.org/wiki/Prohled%C3%A1v%C3%A1n%C3%AD_do_hloubky
  • https://et.wikipedia.org/wiki/S%C3%BCgavuti_otsing
  • https://el.wikipedia.org/wiki/%CE%91%C...%CE%AC_%CE%B2%CE%AC%CE%B8%CE%BF%CF%82
  • https://es.wikipedia.org/wiki/B%C3%BAsqueda_en_profundidad
  • https://eu.wikipedia.org/wiki/Sakonera_bilaketa
  • https://fa.wikipedia.org/wiki/%D8%A7%D...%D8%B9%D9%85%D9%82_%D8%A7%D9%88%D9%84
  • https://fr.wikipedia.org/wiki/Algorithme_de_parcours_en_profondeur
  • https://ko.wikipedia.org/wiki/%EA%B9%8...%EC%9A%B0%EC%84%A0_%ED%83%90%EC%83%89
  • https://hy.wikipedia.org/wiki/%D5%93%D...8%D6%82%D5%A9%D5%B5%D5%B8%D6%82%D5%B6
  • https://hi.wikipedia.org/wiki/%E0%A4%9..._%E0%A4%B8%E0%A4%B0%E0%A5%8D%E0%A4%9A
  • https://he.wikipedia.org/wiki/%D7%90%D...%D7%A9_%D7%9C%D7%A2%D7%95%D7%9E%D7%A7
  • https://ka.wikipedia.org/wiki/%E1%83%A...B%E1%83%94%E1%83%91%E1%83%9C%E1%83%90
  • https://lt.wikipedia.org/wiki/Paie%C5%A1ka_%C4%AF_gyl%C4%AF
  • https://hu.wikipedia.org/wiki/M%C3%A9lys%C3%A9gi_keres%C3%A9s
  • https://nl.wikipedia.org/wiki/Depth-first_search
  • https://no.wikipedia.org/wiki/Dybde-f%C3%B8rst-s%C3%B8k
  • https://pl.wikipedia.org/wiki/Przeszukiwanie_w_g%C5%82%C4%85b
  • https://ro.wikipedia.org/wiki/C%C4%83utare_%C3%AEn_ad%C3%A2ncime
  • https://simple.wikipedia.org/wiki/Depth-first_search
  • https://sr.wikipedia.org/wiki/Pretraga_u_dubinu
  • https://fi.wikipedia.org/wiki/Syvyyssuuntainen_l%C3%A4pik%C3%A4ynti
  • https://sv.wikipedia.org/wiki/Djup-f%C3%B6rst-s%C3%B6kning
  • https://tl.wikipedia.org/wiki/Paghahanap_na_lalim-muna
  • https://tr.wikipedia.org/wiki/Derin_%C3%B6ncelikli_arama
  • https://uk.wikipedia.org/wiki/%D0%9F%D...3%D0%BB%D0%B8%D0%B1%D0%B8%D0%BD%D1%83
  • https://vi.wikipedia.org/wiki/T%C3%ACm_ki%E1%BA%BFm_theo_chi%E1%BB%81u_s%C3%A2u
  • https://zh-yue.wikipedia.org/wiki/%E6%...6%E5%84%AA%E5%85%88%E6%90%9C%E5%B0%8B
  • https://zh.wikipedia.org/wiki/%E6%B7%B...6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2
  • https://www.wikidata.org/wiki/Special:EntityPage/Q816319#sitelinks-wikipedia
  • https://en.wikipedia.org/wiki/Talk:Depth-first_search
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&action=edit
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&action=history
  • https://en.wikipedia.org/wiki/Special:WhatLinksHere/Depth-first_search
  • https://en.wikipedia.org/wiki/Special:RecentChangesLinked/Depth-first_search
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&oldid=1284870794
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&action=info
  • https://en.wikipedia.org/w/index.php?t...1284870794&wpFormIdentifier=titleform
  • https://en.wikipedia.org/w/index.php?t...pedia.org%2Fwiki%2FDepth-first_search
  • https://en.wikipedia.org/w/index.php?t...pedia.org%2Fwiki%2FDepth-first_search
  • https://en.wikipedia.org/w/index.php?t...st_search&action=show-download-screen
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&printable=yes
  • https://commons.wikimedia.org/wiki/Category:Depth-first_search
  • https://en.wikibooks.org/wiki/Algorithm_Implementation/Graphs/Depth-first_search
  • https://www.wikidata.org/wiki/Special:EntityPage/Q816319
  • https://en.wikipedia.org/wiki/Special:EditPage/Depth-first_search
  • https://www.google.com/search?as_eq=wikipedia&q=%22Depth-first+search%22
  • https://www.google.com/search?tbm=nws&...h-first+search%22+-wikipedia&tbs=ar:1
  • https://www.google.com/search?&q=%22Depth-first+search%22&tbs=bkt:s&tbm=bks
  • https://www.google.com/search?tbs=bks:1&q=%22Depth-first+search%22+-wikipedia
  • https://scholar.google.com/scholar?q=%22Depth-first+search%22
  • https://www.jstor.org/action/doBasicSe...%22Depth-first+search%22&acc=on&wc=on
  • https://en.wikipedia.org/wiki/Charles_Pierre_Tr%C3%A9maux
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-1
  • https://en.wikipedia.org/wiki/Maze_solving_algorithm
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-2
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-3
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=1
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-4
  • https://en.wikipedia.org/wiki/Depth-limited_search
  • https://en.wikipedia.org/wiki/Breadth-...rch#Bias_towards_nodes_of_high_degree
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=2
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=3
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=4
  • https://en.wikipedia.org/wiki/Binary_trees
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=5
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-5
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-6
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-7
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-8
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=6
  • https://en.wikipedia.org/wiki/Bridge_(graph_theory)#Bridge-finding_algorithm
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-9
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-10
  • https://en.wikipedia.org/wiki/Maze_generation
  • https://en.wikipedia.org/wiki/Primogeniture#Absolute_primogeniture
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-11
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=7
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-12
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-mehlhorn-13
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-14
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_note-15
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=8
  • https://en.wikipedia.org/wiki/Search_game
  • https://en.wikipedia.org/w/index.php?t...th-first_search&action=edit§ion=9
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-1
  • https://en.wikipedia.org/w/index.php?t...lletier-Thibert&action=edit&redlink=1
  • https://www.worldcat.org/search?fq=x0:jrnl&q=n2:0980-6032
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-2
  • https://books.google.com/books?id=m3QTSMYm5rkC&pg=PA46
  • https://en.wikipedia.org/wiki/Special:BookSources/978-0-521-73653-4
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-3
  • https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-36118-6
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-4
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-5
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-6
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-7
  • https://11011110.github.io/blog/2013/12/17/stack-based-graph-traversal.html
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-8
  • http://worldcat.org/oclc/837386973
  • https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-36121-6
  • https://search.worldcat.org/oclc/837386973
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-9
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-10
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-11
  • https://en.wikipedia.org/wiki/Special:BookSources/978-1-4704-3914-9
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-12
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-mehlhorn_13-0
  • http://people.mpi-inf.mpg.de/~mehlhorn/ftp/Toolbox/GraphTraversal.pdf
  • https://web.archive.org/web/2015090808...hlhorn/ftp/Toolbox/GraphTraversal.pdf
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-14
  • https://doi.org/10.1007%2FBF02122548
  • https://mathscinet.ams.org/mathscinet-getitem?mr=0951989
  • https://api.semanticscholar.org/CorpusID:29440871
  • https://en.wikipedia.org/wiki/Depth-first_search#cite_ref-15
  • https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1701
  • https://doi.org/10.1137%2FS0097539794273083
  • https://mathscinet.ams.org/mathscinet-getitem?mr=1431256
  • https://en.wikipedia.org/w/index.php?t...h-first_search&action=edit§ion=10
  • https://en.wikipedia.org/wiki/Special:BookSources/0-471-38365-1
xhv:alternate
  • http://dev.restore.ovi.cnr.it:8890/abo...title=Special:RecentChanges&feed=atom
  • https://en.wikipedia.org/w/index.php?title=Special:RecentChanges&feed=atom
  • https://en.m.wikipedia.org/wiki/Depth-first_search
  • http://dev.restore.ovi.cnr.it:8890/abo...?title=Depth-first_search&action=edit
  • http://dev.restore.ovi.cnr.it:8890/abo...wikipedia.org/wiki/Depth-first_search
  • https://en.wikipedia.org/w/index.php?title=Depth-first_search&action=edit
xhv:icon
xhv:license
  • Deed - Attribution-ShareAlike 4.0 International - Creative Commons
xhv:stylesheet
  • http://dev.restore.ovi.cnr.it:8890/abo...ent.init&only=styles&skin=vector-2022
  • http://dev.restore.ovi.cnr.it:8890/abo...e.styles&only=styles&skin=vector-2022
mw:PageProp/toc
primary topic
  • https://en.wikipedia.org/wiki/Depth-first_search
Alternative Linked Data Views: Facets | iSPARQL | ODE     Raw Linked Data formats: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD
This material is Open Knowledge   W3C Semantic Web Technology     This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3231, on Linux (x86_64-generic_glibc25-linux-gnu), Single Edition