java爬虫怎么确定url连接,java搜索引擎爬虫,抓取url示例,java爬虫url示例,package cn.o...

java搜索引擎爬虫,抓取url示例,java爬虫url示例,package cn.opackage cn.outofmemory.robot;import java.io.IOException;import java.util.LinkedList;import java.util.List;import java.util.Queue;import java.util.regex.Matcher;import java.util.regex.Pattern;import org.jsoup.Jsoup;import org.jsoup.nodes.Document;import org.jsoup.nodes.Element;import org.jsoup.select.Elements;public class Robot { // robot url private List urlList; // cache url private Queue urlQueue; // define Host public final static String HOST = "debugs.tk"; // constructor public Robot() { super(); // initialization robot's member setUrlList(new LinkedList()); setUrlQueue(new LinkedList()); } // url public List getUrlList() { return urlList; } public void setUrlList(List urlList) { this.urlList = urlList; } // cache public Queue getUrlQueue() { return urlQueue; } public void setUrlQueue(Queue urlQueue) { this.urlQueue = urlQueue; } // Legal link private boolean isURL(String url) { try { // judge url Pattern pattern = Pattern.compile("^[a-zA-z]+://[^\\s]*"); Matcher matcher = pattern.matcher(url); if (matcher.matches()) { return true; } else { return false; } } catch (Exception e) { e.printStackTrace(); return false; } } // whether the url is belong to host public static boolean isHost(String url) { return url.contains(HOST); } // travel all url public void traverse(String seed) { for (this.getUrlQueue().add(seed); !this.getUrlQueue().isEmpty();) { boolean flag = true; Document document = null; try { document = Jsoup.connect(seed).timeout(5000).get(); } catch (IOException e) { e.printStackTrace(); // whether connect success flag = false; } // whether connect success,then select a tag // add these aTag into queue if (flag) { // get url Elements elements = document.select("a[href]"); for (Element e : elements) { String s = e.attr("abs:href"); // Legal link and belong host // and url not in list // then add it if (isURL(s) && s.contains(HOST) && (!getUrlQueue().contains(s)) && (!getUrlList().contains(s))) { this.getUrlQueue().add(s); } } } // get head of queue // and set it seed // travel seed it again seed = this.getUrlQueue().poll(); this.getUrlList().add(seed); // show information // System.out.println("SIZE:" // + this.getUrlQueue().size() + "---" // + seed + " connect!"); } }}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值