Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update README for best first search algorithm #257

Merged
merged 4 commits into from
Dec 28, 2022
Merged

Update README for best first search algorithm #257

Changes from 3 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
0957a6a
Update README for best first search algorithm
pradkrish Dec 24, 2022
0db8534
minor change
pradkrish Dec 24, 2022
40a4ae2
minor change
pradkrish Dec 24, 2022
9379fa5
minor review changes
pradkrish Dec 26, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -544,6 +544,11 @@ Eva(u,v)(i) =I(u ∈ keep[i]) + I(v ∈ keep[i]) +α * \frac{ecount[i]}{(|E|/p)}

The lowest value is taken as partition Id.

### Best First Search

[Best First Search](https://en.wikipedia.org/wiki/Best-first_search)
Best First Search is a class of search algorithms which traverses the graph by exploring the most promising node chosen according to an evaluation function. The worst-case time complexity is O(n * log n) where n is the number of nodes in the graph.

## How to contribute

[![GitHub contributors](https://img.shields.io/github/contributors/ZigRazor/CXXGraph.svg)](https://GitHub.com/ZigRazor/CXXGraph/graphs/contributors/)
Expand Down