c#调用google pagerank类

最新推荐文章于 2018-07-26 18:00:00 发布
最新推荐文章于 2018-07-26 18:00:00 发布
阅读量472 收藏
点赞数
文章标签： google c# url string button textbox

using System;
using System.Collections.Generic;

using System.Web;

using System.IO;
using System.Net;
namespace Lee.WebMasterTool
{
    /// <summary>
    /// PageRank的查询类
    /// </summary>
    public class PageRank
    {
        /// <summary>
        /// 返回对应网站的PageRank
        /// </summary>
        /// <param name="strUrl">网站地址</param>
        /// <returns>PageRank</returns>
        public static int GetPageRank(string strUrl)
        {
            string responseFromServer = "";
            string strCh = CalculateChecksum(strUrl);
            try
            {
                HttpWebRequest HttpWReq = (HttpWebRequest)WebRequest.Create(@"http://www.google.cn/search?client=navclient-auto&features=Rank:&q=info:" + strUrl + "&ch=" + strCh);
                HttpWReq.UserAgent = "Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 5.1; .NET CLR 1.1.4322; .NET CLR 2.0.50727; .NET CLR 3.0.04506.30; .NET CLR 3.5.21022)";
                HttpWReq.Accept = @"image/gif, image/x-xbitmap, image/jpeg, image/pjpeg, application/x-shockwave-flash, application/vnd.ms-excel, application/vnd.ms-powerpoint, application/msword, application/xaml+xml,   application/vnd.ms-xpsdocument, application/x-ms-xbap, application/x-ms-application, */*";
                HttpWebResponse HttpWResp = (HttpWebResponse)HttpWReq.GetResponse();
                using (Stream dataStream = HttpWResp.GetResponseStream())
                {
                    using (StreamReader reader = new StreamReader(dataStream, System.Text.Encoding.GetEncoding("utf-8")))
                    {
                        responseFromServer = reader.ReadToEnd();
                    }
                }
                return Convert.ToInt16(responseFromServer.Substring(9, 1));
            }
            catch
            {
                return 0;
            }
        }

        #region Private Calculate Checksum
        /// <summary>
        /// 新算法,ToolBar 版本>>=2.0.114
        /// </summary>
        static string CalculateChecksum(string sURL)
        {
            uint ch = GoogleCH("info:" + sURL);
            ch = (((ch / 7) << 2) | (((uint)(ch % 13)) & 7));
            uint[] prbuf = new uint[20];
            prbuf[0] = ch;
            for (int i = 1; i < 20; i++)
            {
                prbuf[i] = prbuf[i - 1] - 9;
            }
            ch = GoogleCH(c32to8bit(prbuf), 80);
            return string.Format("6{0}", ch);
        }
        /// <summary>
        /// 老算法,ToolBar 版本<2.0.114
        /// </summary>
        static string CalculateChecksumOld(string sURL)
        {
            uint ch = GoogleCH("info:" + sURL);
            string CalculateChecksum = "6" + Convert.ToString((ch));
            return CalculateChecksum;
        }

        static uint GOOGLE_MAGIC = 0xE6359A60;
        static uint zeroFill(uint a, int b)
        {
            checked
            {
                uint z = 0x80000000;
                if (Convert.ToBoolean(z & a))
                {
                    a = (a >> 1);
                    a &= (~z);
                    a |= 0x40000000;
                    a = (a >> (b - 1));
                }
                else
                {
                    a = (a >> b);
                }
            }
            return a;
        }
        static uint[] mix(uint a, uint b, uint c)
        {
            a -= b;
            a -= c;
            a ^= (uint)(zeroFill(c, 13));
            b -= c; b -= a;
            b ^= (uint)(a << 8);
            c -= a;
            c -= b;
            c ^= (uint)(zeroFill(b, 13));
            a -= b;
            a -= c;
            a ^= (uint)(zeroFill(c, 12));
            b -= c;
            b -= a;
            b ^= (uint)(a << 16);
            c -= a;
            c -= b;
            c ^= (uint)(zeroFill(b, 5));
            a -= b;
            a -= c;
            a ^= (uint)(zeroFill(c, 3));
            b -= c;
            b -= a;
            b ^= (uint)(a << 10);
            c -= a;
            c -= b;
            c ^= (uint)(zeroFill(b, 15));
            return new uint[3] { a, b, c };
        }
        static uint GoogleCH(uint[] url, uint length, uint init)
        {
            if (length == 0)
            {
                length = (uint)url.Length;
            }
            uint a, b;
            a = b = 0x9E3779B9;
            uint c = init;
            int k = 0;
            uint len = length;
            uint[] m_mix = new uint[3];
            while (len >= 12)
            {
                a += (uint)(url[k + 0] + (url[k + 1] << 8) + (url[k + 2] << 16) + (url[k + 3] << 24));
                b += (uint)(url[k + 4] + (url[k + 5] << 8) + (url[k + 6] << 16) + (url[k + 7] << 24));
                c += (uint)(url[k + 8] + (url[k + 9] << 8) + (url[k + 10] << 16) + (url[k + 11] << 24));
                m_mix = mix(a, b, c);
                a = m_mix[0]; b = m_mix[1]; c = m_mix[2];
                k += 12;
                len -= 12;
            }
            c += length;
            /* all the case statements fall through */
            switch (len)
            {
                case 11:
                    {
                        c += (uint)(url[k + 10] << 24);
                        c += (uint)(url[k + 9] << 16);
                        c += (uint)(url[k + 8] << 8);
                        b += (uint)(url[k + 7] << 24);
                        b += (uint)(url[k + 6] << 16);
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 10:
                    {
                        c += (uint)(url[k + 9] << 16);
                        c += (uint)(url[k + 8] << 8);
                        b += (uint)(url[k + 7] << 24);
                        b += (uint)(url[k + 6] << 16);
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 9:
                    {
                        c += (uint)(url[k + 8] << 8);
                        b += (uint)(url[k + 7] << 24);
                        b += (uint)(url[k + 6] << 16);
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                /* the first byte of c is reserved for the length */
                case 8:
                    {
                        b += (uint)(url[k + 7] << 24);
                        b += (uint)(url[k + 6] << 16);
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 7:
                    {
                        b += (uint)(url[k + 6] << 16);
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 6:
                    {
                        b += (uint)(url[k + 5] << 8);
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 5:
                    {
                        b += (uint)(url[k + 4]);
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 4:
                    {
                        a += (uint)(url[k + 3] << 24);
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 3:
                    {
                        a += (uint)(url[k + 2] << 16);
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 2:
                    {
                        a += (uint)(url[k + 1] << 8);
                        a += (uint)(url[k + 0]);
                        break;
                    }
                case 1:
                    {
                        a += (uint)(url[k + 0]);
                        break;
                    }
                /* case 0: nothing left to add */
            }
            m_mix = mix(a, b, c);
            /*---report the result */
            return m_mix[2];
        }
        static uint GoogleCH(string url, uint length)
        {
            uint[] m_urluint = new uint[url.Length];
            for (int i = 0; i < url.Length; i++)
            {
                m_urluint[i] = url[i];
            }
            return GoogleCH(m_urluint, length, GOOGLE_MAGIC);
        }
        static uint GoogleCH(string sURL)
        {
            return GoogleCH(sURL, 0);
        }
        static uint GoogleCH(uint[] url, uint length)
        {
            return GoogleCH(url, length, GOOGLE_MAGIC);
        }
        static uint[] c32to8bit(uint[] arr32)
        {
            uint[] arr8 = new uint[arr32.GetLength(0) * 4 + 3];
            for (int i = 0; i < arr32.GetLength(0); i++)
            {
                for (int bitOrder = i * 4; bitOrder <= i * 4 + 3; bitOrder++)
                {
                    arr8[bitOrder] = arr32[i] & 255;
                    arr32[i] = zeroFill(arr32[i], 8);
                }
            }
            return arr8;
        }
        #endregion
    }
}


============================================================================

default.aspx.cs代码

using System;
using System.Collections.Generic;

using System.Web;
using System.Web.UI;
using System.Web.UI.WebControls;

public partial class _Default : System.Web.UI.Page
{
    protected void Page_Load(object sender, EventArgs e)
    {

       
    }
    protected void Button1_Click(object sender, EventArgs e)
    {
        int intPageRank = Lee.WebMasterTool.PageRank.GetPageRank(txt_http.Text);
        ltl_pr.Text = "该网站的PR值为：" + intPageRank;
    }
}
===============================================================

default.aspx页面代码：

<%@ Page Language="C#" AutoEventWireup="true" CodeFile="Default.aspx.cs" Inherits="_Default" %>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

<html xmlns="http://www.w3.org/1999/xhtml">
<head runat="server">
    <title></title>
</head>
<body>
    <form id="form1" runat="server">
    <div>
        <asp:TextBox ID="txt_http" runat="server"></asp:TextBox>
        <asp:Button ID="Button1" runat="server" Text="查询PR值" οnclick="Button1_Click" />
       
       
    </div>
    <asp:Literal ID="ltl_pr" runat="server"></asp:Literal>
    </form>
</body>
</html>
 

dandandeshui
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
使用C#实现PageRank算法
买烤麸烤饼儿的博客
05-21 314
使用C#实现PageRank算法 using System; using System.Collections.Generic; using System.IO; namespace EXP2_C { class PageRank { public int N; private double AFA; private double DELTA; private double MAX_TIMES; List&lt
PageRank算法的C#实现
03-25
近来自己在研究一下排序算法，结果在网上找了很久都只有两个Java实现的PageRank算法，其余的基本上是理论研究，对初学者帮助不大，希望能对你有些帮助。
【原创】机器学习之PageRank算法应用与C#实现(2)球队排名应用与C#代码
alad64007的博客
05-27 490
　　在上一篇文章：机器学习之PageRank算法应用与C#实现(1)算法介绍中，对PageRank算法的原理和过程进行了详细的介绍，并通过一个很简单的例子对过程进行了讲解。从上一篇文章可以很快的了解PageRank的基础知识。相比其他一些文献的介绍，上一篇文章的介绍非常简洁明了。说明：本文的主要内容都是来自“赵国，宋建成.Google搜索引擎的数学模型及其应用,西南民族大学学报自然科学...
PageRank之基于C和C#的基本实现
ahkg5610的博客
04-12 288
重点不是说PageRank是什么，而是怎么实现PageRank 什么是PageRank？ PageRank，网页排名，又称网页级别、Google左侧排名或佩奇排名，是一种由[1] 根据网页之间相互的超链接计算的技术，而作为网页排名的要素之一，以Google公司创办人拉里·佩奇（Larry Page）之姓来命名。Google用它来体现网页的相关性和重要性，在搜索引擎优化操作中是经常被...
C# 语言Pagerank两种实现
weixin_30498807的博客
08-26 69
最近正在学习Hadoop相关的知识，参考了很多材料，如下是C#的两种实现。 目前对这个算法只是知道了运算的过程和思路，理解的还不是太深刻，我看到论坛上很多朋友算的pr值超过1，总感觉是有问题，具体哪有问题反倒倒说不好了，请知晓的朋友帮忙分析下。 附件是两种实现方式，感兴趣的朋友可以自行下来看看，有不对的地方，欢迎批评指正。 这是第二种实现的代码,我是通过判断两...
C# winform 获取 google pagerank
03-20
此方法用于C# winform 获取指定页面的google pagerank值，绝对正确
pagerank:PageRank算法的C＃实现
05-14
PageRank是Google创始人Larry Page提出的一种网页排名算法，它通过计算网页之间的链接关系来评估网页的重要性。这个算法在搜索引擎优化（SEO）和网络数据分析中扮演着关键角色。在这个C#实现中，我们将深入探讨...
Google PageRank And Beyond.zip
05-17
The first book ever about the science of web page rankings, 'Google's PageRank and Beyond' supplies the answers to these and other questions, and more.（本压缩包包含pdf与djvu格式文件，高清版）
谷歌pagerank算法
03-04
主要讲解了pagerank算法，有兴趣的同学可以看一下，我觉得还不错
C# Google PageRank .net库 (checksum)
.NET技术文章转载博客
05-10 1009
　今天看到Google PageRank ChecksumPHP代码才发现上次发布的库写的很烂，我根本没有去理解里面的意思，有很多函数是没有必要的，如>位操作都已经是现成的，我怎么还照着vb代码改写，真是愚蠢。　　为了弥补我的愚蠢，把php代码改编成的.net库,发布出来。　　Google PageRank 链接库下载地址：http://code.knowsky.com/down/2847.h
【原创】机器学习之PageRank算法应用与C#实现(1)算法介绍
alad64007的博客
05-07 263
考虑到知识的复杂性，连续性，将本算法及应用分为3篇文章，请关注，将在本月逐步发表。 1.机器学习之PageRank算法应用与C#实现(1)算法介绍 2.机器学习之PageRank算法应用与C#实现(2)球队排名应用与C#代码 3.机器学习之PageRank算法应用与C#实现(3)球队实力排名应用与C#代码 　　Pagerank是Google排名运算法则（排名公式）的一部分，是G...
PageRank算法原理与实现
热门推荐
leadai的博客
07-26 5万+
正文共835个字，8张图，预计阅读时间6分钟。1、PageRank1.1.简介PageRank，又称网页排名、谷歌左侧排名，是一种由搜索引擎根据网页之间相互的超链接计算的...
浅谈PageRank
guoziqing506的博客
04-25 2万+
1996年，两位还在斯坦福大学攻读计算机理学博士学位的研究生，开始了一项研究：如何对互联网上“成万上亿”的网页进行排序。在当时看来，这只是发生在斯坦福的一个普通课题研究而已，然而包括其研究者在内，都没有意识到，这项研究最后的成果，会引发互联网搜索引擎领域一个划时代的变革。 这两位博士的名字相信大家都很熟悉了，他们正是后来大名鼎鼎的Google公司的创始人：拉里佩奇（Larry Page）和谢尔盖
PageRank算法
云计算?
09-21 3317
1. PageRank算法概述 PageRank,即网页排名，又称网页级别、Google左侧排名或佩奇排名。 是Google创始人拉里·佩奇和谢尔盖·布林于1997年构建早期的搜索系统原型时提出的链接分析算法，自从Google在商业上获得空前的成功后，该算法也成为其他搜索引擎和学术界十分关注的计算模型。目前很多重要的链接分析算法都是在PageRank算法基础上衍生出来的。PageRa...
探索Google PageRank背后的科学：搜索引擎排名秘钥
"《Google PageRank与超越：搜索引擎排名的科学》是一本由Amy N. Langville和Carl D. Meyer合著的专业书籍，专为对新兴科技感兴趣的读者以及具备线性代数基础知识的高级读者而设计。该书以PDF无损版本呈现，相较于...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值