# depth-first search Published articles for depth-first search. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Binary Search on Graphs DevFeed: [Binary Search on Graphs]() Original publisher: [Read original article]() Published: 2017-11-08T08:59:38Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Algorithms, Complexity](), [Graphs](), [Algorithm]() Tags: [algorithm](), [algorithms](), [binary-search](), [depth-first-search](), [dijkstra](), [equivalence-queries](), [graph](), [graphs](), [learning-theory](), [mathematics](), [programming](), [python](), [search](), [vertex]() ### AI overview The article examines whether binary search can be applied to graphs. It presents a graph-search model in which queries about vertices return either the target or an edge on a shortest path toward it, and notes that the line-graph case corresponds to ordinary binary search. ### Source excerpt Binary search is one of the most basic algorithms I know. Given a sorted list of comparable items and a target item being sought, binary search looks at the middle of the list, and compares it to the target. If the target is larger, we repeat on the smaller half of the list, and vice versa. With each comparison the binary search algorithm cuts the search space in half. The result is a guarantee of no more than $ \log(n)$ comparisons, for a total runtime of $ O(\log n)$. ## Why there is no Hitchhiker's Guide to Mathematics for Programmers DevFeed: [Why there is no Hitchhiker's Guide to Mathematics for Programmers]() Original publisher: [Read original article]() Published: 2013-02-08T11:24:53Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Mathematics](), [Programming](), [C++](), [Functional programming](), [Java](), [Test-driven development]() Tags: [c-plus-plus](), [depth-first-search](), [error](), [functional-programming](), [java](), [mathematics](), [test](), [type-coercion]() ### AI overview The article reflects on the author's development as a programmer and on the difficulty of learning mathematics for programming. It uses experiences with Java, C++, functional programming, recursive search, testing, and a segmentation fault to illustrate how programming mistakes can arise from design misunderstandings rather than syntax alone. ### Source excerpt For those who aren't regular readers: as a followup to this post, there are four posts detailing the basic four methods of proof, with intentions to detail some more advanced proof techniques in the future. You can find them on this blog's primers page. Do you really want to get better at mathematics? Remember when you first learned how to program? I do. I spent two years experimenting with Java programs on my own in high school. ## Depth- and Breadth-First Search DevFeed: [Depth- and Breadth-First Search]() Original publisher: [Read original article]() Published: 2013-01-22T11:44:27Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Graphs](), [Algorithms](), [Data structures](), [graph theory](), [Programming](), [Python]() Tags: [algorithms](), [breadth-first-search](), [computer](), [computer-science](), [data-structures](), [depth-first-search](), [graph-theory](), [graphs](), [mathematics](), [optimization](), [programming](), [python](), [queue](), [stack]() ### AI overview This tutorial introduces graph search through depth-first search and breadth-first search. It reviews directed graphs, vertices, edges, adjacency functions, and implementations of the basic graph data structure in mathematical terms and Python. ### Source excerpt The graph is among the most common data structures in computer science, and it's unsurprising that a staggeringly large amount of time has been dedicated to developing algorithms on graphs. Indeed, many problems in areas ranging from sociology, linguistics, to chemistry and artificial intelligence can be translated into questions about graphs. It's no stretch to say that graphs are truly ubiquitous. Even more, common problems often concern the existence and optimality of paths from one vertex to another with certain properties.