checking a loop in graph can be done by DFS.
On 4/23/12, Anshul Gupta wrote:
> There could be finite number of paths between source and destination even
> if there is a loop in the graph, you need to check if there is a loop which
> lies on a path from source to destination
>
> Anshul Gupta
>
> -
Guys i am doing a project related to intra network...i am stuck at the
server side...i know how to do the scripting at server side and
develop web pages...but i am new to code for a server itself...can you
suggest me about what type of server to be used...or can i configure
the apache server itself
There could be finite number of paths between source and destination even
if there is a loop in the graph, you need to check if there is a loop which
lies on a path from source to destination
Anshul Gupta
--
You received this message because you are subscribed to the Google Groups
"Algorithm Ge
@Bashrc: An additional constraint is that the data be integers. Counting
sort isn't applicable to floats, doubles, or character strings. That's why
I suggested using a radix sort. It is actually like a counting sort on
successive bit fields of the data.
Dave
On Sunday, April 22, 2012 8:37:26
@Ilya: As I said in my earlier post,
https://groups.google.com/d/msg/algogeeks/QyNBGrMHaCs/evd8iLvP2CUJ, use a
radix sort. It is O(n) in time, and has an O(n) space requirement.
Dave
On Sunday, April 22, 2012 6:55:03 PM UTC-5, Ilya Albrekht wrote:
> I'm not aware of any O(n) sort algorithms.
