Created
February 18, 2017 00:52
-
-
Save nihitx/420bf8e462169cc35250d6da5543c5fc to your computer and use it in GitHub Desktop.
Search Engine With Crawler
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# get best page via ranking | |
def lucky_search(index, ranks, keyword): | |
pages = lookup(index, keyword) | |
if pages == None: | |
return None | |
best = pages[0] | |
for p in pages: | |
if ranks[p] > ranks[best]: | |
best = p | |
return best | |
def get_page(url): | |
if url in cache: | |
return cache[url] | |
return "" | |
def get_next_target(page): | |
start_link = page.find('<a href=') | |
if start_link == -1: | |
return None, 0 | |
start_quote = page.find('"', start_link) | |
end_quote = page.find('"', start_quote + 1) | |
url = page[start_quote + 1:end_quote] | |
return url, end_quote | |
def get_all_links(page): | |
links = [] | |
while True: | |
url, endpos = get_next_target(page) | |
if url: | |
links.append(url) | |
page = page[endpos:] | |
else: | |
break | |
return links | |
def union(a, b): | |
for e in b: | |
if e not in a: | |
a.append(e) | |
def add_page_to_index(index, url, content): | |
words = content.split() | |
for word in words: | |
add_to_index(index, word, url) | |
def add_to_index(index, keyword, url): | |
if keyword in index: | |
index[keyword].append(url) | |
else: | |
index[keyword] = [url] | |
def lookup(index, keyword): | |
if keyword in index: | |
return index[keyword] | |
else: | |
return None | |
def crawl_web(seed): # returns index, graph of inlinks | |
tocrawl = [seed] | |
crawled = [] | |
graph = {} # <url>, [list of pages it links to] | |
index = {} | |
while tocrawl: | |
page = tocrawl.pop() | |
if page not in crawled: | |
content = get_page(page) | |
add_page_to_index(index, page, content) | |
outlinks = get_all_links(content) | |
graph[page] = outlinks | |
union(tocrawl, outlinks) | |
crawled.append(page) | |
return index, graph | |
def compute_ranks(graph): | |
d = 0.8 # damping factor | |
numloops = 10 | |
ranks = {} | |
npages = len(graph) | |
for page in graph: | |
ranks[page] = 1.0 / npages | |
for i in range(0, numloops): | |
newranks = {} | |
for page in graph: | |
newrank = (1 - d) / npages | |
for node in graph: | |
if page in graph[node]: | |
newrank = newrank + d * (ranks[node] / len(graph[node])) | |
newranks[page] = newrank | |
ranks = newranks | |
return ranks |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment