Skip to content

A reference implementation of a list ordering system like JIRA's Lexorank algorithm

Notifications You must be signed in to change notification settings

kvandake/lexorank-dotnet

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LexoRank on C#

A reference implementation of a list ordering system like JIRA's Lexorank algorithm.

Build Status NuGet version

Getting Started

Install-Package LexoRank

Using

Static methods

using LexoAlgorithm;

// min
const minLexoRank = LexoRank.Min();
// max
const maxLexoRank = LexoRank.Max();
// middle
const maxLexoRank = LexoRank.Middle();
// parse
const parsedLexoRank = LexoRank.Parse('0|0i0000:');

Public methods

using LexoAlgorithm;

// any lexoRank
const lexoRank = LexoRank.Middle();

// generate next lexorank
const nextLexoRank = lexoRank.GenNext();

// generate previous lexorank
const prevLexoRank = lexoRank.GenPrev();

// ToString
const lexoRankStr = lexoRank.ToString();

Calculate LexoRank

LexRank calculation based on existing LexoRanks.

using LexoAlgorithm;

// any lexorank
const any1LexoRank = LexoRank.Min();
// another lexorank
const any2LexoRank = any1LexoRank.GenNext().GenNext();
// calculate between
const betweenLexoRank = any1LexoRank.Between(any2LexoRank);

Related projects

Licence

MIT


I have not found information about the license of the algorithm LexoRank. If the rights are violated, please contact me to correct the current license.

About

A reference implementation of a list ordering system like JIRA's Lexorank algorithm

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages