notes find out the vertices adjacent to remaining nodes of the graph patha path from vertex to vertex is sequence of verticeseach adjacent to the next consider the above example again , , is path , , is path , , is pathis , , pathhow many paths are there from vertex to vertex you may notice that there is path existing in the above example which starts at vertex and finishes at vertex path , , , , , such path is called cycle cycle is path in which first and last vertices are the same do we have path from any vertex to any other vertex in the above exampleif you see it carefullyyou may find the answer to the above question as yes such graph is said to be connected graph graph is called connected if there exists path from any vertex to any other vertex there are graphs which are unconnected consider the graph in figure figure an unconnected graph it is an unconnected graph you may say that these are two graphs and not one look at the figure in its totality and apply the definition of graph does it satisfy the definition of graphit does thereforeit is one graph having two unconnected components since there are unconnected componentsit is an unconnected graph so far we have talked of pathscycles and connectivity of undirected graph in digraph the path is called directed path and cycle as directed cycle figure digraph lovely professional university