NAME

Graph::Similarity::CoupledNodeEdgeScoring - Coupled Node-Edge Scoring implementation

VERSION

Version 0.0.2

SYNOPSIS

DESCRIPTION

This is the implementation of the below papers.

Vincent D. Blondel "A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching"

and

Laura Zager "Graph Similarity and Matching"

METHODS

calculate()

This calculates Coupled Node-Edge Scoring. The algorithm is mentioned in Page.655 in Blondel's paper. The convergence is not taken into account. Please set the number of iteration instead.

AUTHOR

Shohei Kameda, <shoheik at cpan.org>

LICENSE AND COPYRIGHT

This program is free software; you can redistribute it and/or modify it under the terms of either: the GNU General Public License as published by the Free Software Foundation; or the Artistic License.

See http://dev.perl.org/licenses/ for more information.

To install Graph::Similarity, copy and paste the appropriate command in to your terminal.

cpanm

cpanm Graph::Similarity

CPAN shell

perl -MCPAN -e shell
install Graph::Similarity

For more information on module installation, please visit the detailed CPAN module installation guide.

	Global
`s`	Focus search bar
`?`	Bring up this help dialog

	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)

	POD
`g` `a`	Go to author
`g` `c`	Go to changes
`g` `i`	Go to issues
`g` `d`	Go to dist
`g` `r`	Go to repository/SCM
`g` `s`	Go to source
`g` `b`	Go to file browse

	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)