Travelling salesman problem using backtracking

/*
    Java Program for
    Travelling salesman problem using backtracking
*/
class AjlistNode
{
	// Vertices node key
	public int id;
	public int weight;
	public AjlistNode next;
	public AjlistNode(int id, int weight)
	{
		// Set value of node key
		this.id = id;
		this.weight = weight;
		this.next = null;
	}
}
class Vertices
{
	public int data;
	public AjlistNode next;
	public Vertices(int data)
	{
		this.data = data;
		this.next = null;
	}
}
public class Graph
{
	// Number of Vertices
	public int size;
	public Vertices[] node;
	public int result;
	public Graph(int size)
	{
		// Set value
		this.size = size;
		this.node = new Vertices[size];
		this.result = Integer.MAX_VALUE;
		this.setData();
	}
	// Set initial node value
	public void setData()
	{
		if (node == null)
		{
			System.out.println("\nEmpty Graph");
		}
		else
		{
			for (int index = 0; index < size; index++)
			{
				node[index] = new Vertices(index);
			}
		}
	}
	// Connect two nodes
	public void connect(int start, int last, int weight)
	{
		AjlistNode new_edge = new AjlistNode(last, weight);
      
		if (node[start].next == null)
		{
			node[start].next = new_edge;
		}
		else
		{
			AjlistNode temp = node[start].next;
          
			while (temp.next != null)
			{
				temp = temp.next;
			}
			temp.next = new_edge;
		}
	}
	// Add edge of two nodes
	public void addEdge(int start, int last, int weight)
	{
		if (start >= 0 && start < size && last >= 0 && 
            last < size && node != null)
		{
			connect(start, last, weight);
			if (start == last)
			{
				// Self looping situation
				return;
			}
			connect(last, start, weight);
		}
		else
		{
			System.out.println("\nHere Something Wrong");
		}
	}
	public void printGraph()
	{
		if (size > 0 && node != null)
		{
			// Print graph ajlist Node value
			for (int index = 0; index < size; ++index)
			{
				System.out.print("\nAdjacency list of vertex " + index + " :");
				AjlistNode temp = node[index].next;
				while (temp != null)
				{
					System.out.print("  " + node[temp.id].data);
					// visit to next edge
					temp = temp.next;
				}
			}
		}
	}
	public void findMinPath(int source, 
      int index, 
      boolean[] visit, 
      int sum, 
      int count)
	{
		if (source == index && count == this.size)
		{
			// When reached all other vertex and back to source vertex
			if (this.result > sum)
			{
				this.result = sum;
			}
			return;
		}
		if (visit[index] == true)
		{
			return;
		}
		// Here modified  the value of visited node
		visit[index] = true;
		// This is used to iterate nodes edges
		AjlistNode temp = node[index].next;
		while (temp != null)
		{
			findMinPath(source, temp.id, visit, 
                        sum + (temp.weight), count + 1);
			// Visit to next edge
			temp = temp.next;
		}
		// Reset the value of visited node status
		visit[index] = false;
	}
	public void travllingSalesmanProblem(int source)
	{
		this.result = Integer.MAX_VALUE;
		boolean[] visit = new boolean[this.size];
		// Set initial visited node status 
		for (int i = 0; i < size; ++i)
		{
			visit[i] = false;
		}
		System.out.print("\n Source node : " + source);
		findMinPath(source, source, visit, 0, 0);
		System.out.print("\n Result : " + this.result);
	}
	public static void main(String[] args)
	{
		// 5 implies the number of nodes in graph
		Graph g = new Graph(5);
		g.addEdge(0, 1, 7);
		g.addEdge(0, 2, 4);
		g.addEdge(0, 3, 8);
		g.addEdge(0, 4, 6);
		g.addEdge(1, 2, 5);
		g.addEdge(1, 3, 5);
		g.addEdge(1, 4, 1);
		g.addEdge(2, 3, 5);
		g.addEdge(2, 4, 4);
		g.addEdge(3, 4, 3);
		// print graph element
		g.printGraph();
		// Test 
		int source = 0;
		g.travllingSalesmanProblem(source);
	}
}

Output

Adjacency list of vertex 0 :  1  2  3  4
Adjacency list of vertex 1 :  0  2  3  4
Adjacency list of vertex 2 :  0  1  3  4
Adjacency list of vertex 3 :  0  1  2  4
Adjacency list of vertex 4 :  0  1  2  3
 Source node : 0
 Result : 20