C#

<br />
public void OnPaint(object sender,PaintEventArgs e)<br />
		{<br />
			Graphics g=e.Graphics;	<br />
			Pen pen=new Pen(Color.Magenta);<br />
			Point p1=new Point(index1,index2);<br />
			Point p2=new Point(index3,index4);<br />
			g.DrawLine(pen,p1,p2);			<br />
		}	<br />
<br />
public void mouseUp(object sender,MouseEventArgs e)<br />
		{<br />
			index3=e.X;index4=e.Y;		<br />
			this.Paint+=new PaintEventHandler(this.OnPaint);	<br />
			Invalidate();<br />
		}<br />
		public void mouseDown(object sender,MouseEventArgs e)<br />
		{<br />
			index1=e.X;index2=e.Y;					<br />
		}<br />

Mahi.Ragava wrote:

this.Paint+=new PaintEventHandler(this.OnPaint);

#region Constructor

public YourClassNameHere()
{
	editexGroups = new Hashtable( 24 );
	editexGroups[ 'a' ] = new int[] { 0 };
	editexGroups[ 'b' ] = new int[] { 1 };
	editexGroups[ 'c' ] = new int[] { 2, 9 };
	editexGroups[ 'd' ] = new int[] { 3 };
	editexGroups[ 'e' ] = new int[] { 0 };
	editexGroups[ 'f' ] = new int[] { 7 };
	editexGroups[ 'g' ] = new int[] { 6 };
	editexGroups[ 'i' ] = new int[] { 0 };
	editexGroups[ 'j' ] = new int[] { 6 };
	editexGroups[ 'k' ] = new int[] { 2 };
	editexGroups[ 'l' ] = new int[] { 4 };
	editexGroups[ 'm' ] = new int[] { 5 };
	editexGroups[ 'n' ] = new int[] { 5 };
	editexGroups[ 'o' ] = new int[] { 0 };
	editexGroups[ 'p' ] = new int[] { 7 };
	editexGroups[ 'q' ] = new int[] { 2 };
	editexGroups[ 'r' ] = new int[] { 4 };
	editexGroups[ 's' ] = new int[] { 8, 9 };
	editexGroups[ 't' ] = new int[] { 3 };
	editexGroups[ 'u' ] = new int[] { 0 };
	editexGroups[ 'v' ] = new int[] { 7 };
	editexGroups[ 'x' ] = new int[] { 8 };
	editexGroups[ 'y' ] = new int[] { 0 };
	editexGroups[ 'z' ] = new int[] { 8, 9 };
}

#endregion

#region Editex Distance

/// <summary>
/// Calculates the Editex distance between two strings.
/// </summary>
/// <param name="first">The first <see cref="string"/>.</param>
/// <param name="second">The second <see cref="string"/>.</param>
/// <returns>The Editex distance between the two <see cref="string"/>s.</returns>
public int EditexDistance( string first, string second )
{
	first = StringCleaner.NullToEmpty( first ).ToLower();
	second = StringCleaner.NullToEmpty( second ).ToLower();

	if( ( first == string.Empty && second == string.Empty ) || first == second )
	{
		return 0;
	}

	int[,] array = new int[ first.Length + 1, 2 ];
	array[ 0, 0 ] = 0;
	array[ 1, 0 ] = 1;
	array[ 0, 1 ] = 1;
	for( int i = 2; i < first.Length + 1; i++ )
	{
		array[ i, 0 ] = array[ i - 1, 0 ] + d( first[ i - 2 ], first[ i - 1 ] );
		array[ i, 1 ] = array[ i - 1, 0 ] + d( first[ i - 2 ], first[ i - 1 ] );
	}

	int sourceColumn = 0;
	int targetColumn = 1;
	int left = 0;
	int up = 0;
	int diag = 0;
	for( int i = 1; i < second.Length + 1; i++ )
	{
		array[ 0, targetColumn ] = ( ( i != 1 )? array[ 0, sourceColumn ] + d( second[ i - 2 ], second[ i - 1 ] ) : 1 );

		for( int j = 1; j < first.Length + 1; j++ )
		{
			left = array[ j, sourceColumn ];
			up = array[ j - 1, targetColumn ];
			diag = array[ j - 1, sourceColumn ] + r( first[ j - 1 ], second[ i - 1 ] );
			if( j > 1 )
			{
				up += d( first[ j - 2 ], first[ j - 1 ] );
			}
			else
			{
				up++;
			}
			if( i > 1 )
			{
				left += d( second[ i - 2 ], second[ i - 1 ] );
			}
			else
			{
				left++;
			}
			array[ j, targetColumn ] = StringComparer.Min( left, up, diag );
		}

		sourceColumn = Math.Abs( sourceColumn - 1 );
		targetColumn = Math.Abs( targetColumn - 1 );
	}
		
	return array[ first.Length, sourceColumn ];
}

/// <summary>
/// Calculates the <i>d</i>-value according to the Editex
/// algorithm.
/// </summary>
/// <param name="a">The first character.</param>
/// <param name="b">The second character.</param>
/// <returns>
/// Refer to the algorithm.
/// </returns>
private int d( char a, char b )
{
	if( a == 'h' || a == 'w' )
	{
		return 1;
	}
	else if( b == 'h' || b == 'w' )
	{
		return 0;
	}
	return r( a, b );
}

/// <summary>
/// Calculates the <i>r</i>-value according to the Editex
/// algorithm.
/// </summary>
/// <param name="a">The first character.</param>
/// <param name="b">The second character.</param>
/// <returns>
/// Refer to the algorithm.
/// </returns>
private int r( char a, char b )
{
	if( a == b )
	{
		return 0;
	}
	bool inSameGroup = false;
	int[] ga = ( int[] ) editexGroups[ a ];
	int[] gb = ( int[] ) editexGroups[ b ];
	if( ga == null || gb == null )
	{
		return 0;
	}
	for( int i = 0; i < ga.Length && !inSameGroup; i++ )
	{
		for( int j = 0; j < gb.Length && !inSameGroup; j++ )
		{
			inSameGroup = ( ga[ i ] == gb[ j ] );
		}
	}
	return ( ( inSameGroup )? 1 : 2 );
}

/// <summary>
/// Contains the group associations for strings.
/// </summary>
private Hashtable editexGroups;

#endregion