# dijkstra

Published articles for dijkstra.

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](<https://devfeed.tech/articles/binary-search-on-graphs-40417.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2017/11/08/binary-search-on-graphs/>)

Published: 2017-11-08T08:59:38Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [binary-search](<https://devfeed.tech/tags/binary-search.md>), [depth-first-search](<https://devfeed.tech/tags/depth-first-search.md>), [dijkstra](<https://devfeed.tech/tags/dijkstra.md>), [equivalence-queries](<https://devfeed.tech/tags/equivalence-queries.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [learning-theory](<https://devfeed.tech/tags/learning-theory.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [search](<https://devfeed.tech/tags/search.md>), [vertex](<https://devfeed.tech/tags/vertex.md>)

### 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)$.