Find if there is a path of more than k length from a source

/*
    Java Program for
    Find if there is a path of more than k length from a source
*/
class AjlistNode
{
	// Vertices node key
	public int id;
	public int length;
	public AjlistNode next;
	public AjlistNode(int id, int length)
	{
		// Set value of node key
		this.id = id;
		this.length = length;
		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 Graph(int size)
	{
		//set value
		this.size = size;
		this.node = new Vertices[size];
		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 length)
	{
		AjlistNode new_edge = new AjlistNode(last, length);
		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 length)
	{
		if (start >= 0 && start < size && last >= 0 && 
            last < size && node != null)
		{
			connect(start, last, length);
			if (start == last)
			{
				// Self looping situation
				return;
			}
			connect(last, start, length);
		}
		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 boolean isLengthGreaterThanK(
      			int index, boolean[] visit, int sum, int k)
	{
		if (index < 0 || index >= this.size)
		{
			return false;
		}
		if (visit[index] == true)
		{
			// When node is already includes in current path
			return false;
		}
		if (sum > k)
		{
			// When length sum is greater than k
			return true;
		}
		// 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)
		{
			if (isLengthGreaterThanK(temp.id, 
                               visit, sum + (temp.length), k))
			{
				// Found path with length greater than k
				return true;
			}
			// Visit to next edge
			temp = temp.next;
		}
		// Reset the value of visited node status
		visit[index] = false;
		return false;
	}
	public void checkPathGreaterThanK(int source, int k)
	{
		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);
		System.out.print("\n Length  k : " + k);
		if (isLengthGreaterThanK(source, visit, 0, k))
		{
			System.out.print("\n Result : YES\n");
		}
		else
		{
			System.out.print("\n Result : NO\n");
		}
	}
	public static void main(String[] args)
	{
		// 10 implies the number of nodes in graph
		Graph g = new Graph(10);
		g.addEdge(0, 1, 9);
		g.addEdge(0, 2, 10);
		g.addEdge(0, 9, 4);
		g.addEdge(1, 3, 6);
		g.addEdge(1, 9, 5);
		g.addEdge(2, 4, 3);
		g.addEdge(2, 7, 7);
		g.addEdge(2, 9, 2);
		g.addEdge(3, 5, 5);
		g.addEdge(3, 7, 4);
		g.addEdge(3, 9, 3);
		g.addEdge(4, 6, 4);
		g.addEdge(5, 6, 3);
		g.addEdge(5, 7, 8);
		g.addEdge(6, 7, 8);
		g.addEdge(6, 8, 4);
		// print graph element
		g.printGraph();
		// Test A
		int source = 0;
		int k = 48;
		g.checkPathGreaterThanK(source, k);
		// Test B
		source = 0;
		k = 51;
		g.checkPathGreaterThanK(source, k);
		// Test C
		source = 8;
		k = 54;
		g.checkPathGreaterThanK(source, k);
	}
}

Output

Adjacency list of vertex 0 :  1  2  9
Adjacency list of vertex 1 :  0  3  9
Adjacency list of vertex 2 :  0  4  7  9
Adjacency list of vertex 3 :  1  5  7  9
Adjacency list of vertex 4 :  2  6
Adjacency list of vertex 5 :  3  6  7
Adjacency list of vertex 6 :  4  5  7  8
Adjacency list of vertex 7 :  2  3  5  6
Adjacency list of vertex 8 :  6
Adjacency list of vertex 9 :  0  1  2  3
 Source node : 0
 Length  k : 48
 Result : YES

 Source node : 0
 Length  k : 51
 Result : NO

 Source node : 8
 Length  k : 54
 Result : YES