Page tree
Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

Version 1 Next »

In a given graph, a path is a sequence of nodes (N1,N2,...,Nk) where every two consecutive nodes are connected by an edge, i.e., N1 is connected to N2, N2 is connected to N3, etc.


  • No labels