Click here to Skip to main content
15,892,768 members
Home / Discussions / Managed C++/CLI
   

Managed C++/CLI

 
GeneralPassing managed object through clipboard Pin
rkvs1-Jun-04 10:35
rkvs1-Jun-04 10:35 
Generalfirewall Pin
shahrokh nabavi1-Jun-04 7:07
shahrokh nabavi1-Jun-04 7:07 
GeneralRe: firewall Pin
kmcguire1-Jun-04 15:52
kmcguire1-Jun-04 15:52 
GeneralHTML edit and view control. Pin
kmcguire27-May-04 22:54
kmcguire27-May-04 22:54 
GeneralRe: HTML edit and view control. Pin
kmcguire28-May-04 3:23
kmcguire28-May-04 3:23 
GeneralVSPackage load failure after incorporating PLK Pin
ManSus27-May-04 10:59
ManSus27-May-04 10:59 
GeneralAbout a graph algorithm! It is very diffcult , I think! Pin
ymq832827-May-04 0:09
ymq832827-May-04 0:09 
GeneralRe: About a graph algorithm! It is very diffcult , I think! Pin
Curi0us_George27-May-04 19:52
Curi0us_George27-May-04 19:52 
First off, you need to reduce the problem. You cannot necessarily determine all paths from I to J if there is a cycle in the graph, because there are (potentially) infinite paths.

Detecting graph cycles is fairly simple. Search on Google for how.

Now, if you are willing to reduce the problem to only Directed Acyclic Graphs, you simply start at I and traverse every possible path. The simplest implementation is to store a representation of the path (possibly just a list of vertex pointers). Every time you come to a point where you could traverse down two different edges, copy the list and traverse down both. (Of course, if there are more than two possible edges, make additional copies and traverse for each.) Since the graph is acyclic, the paths will either run into J (at which point they record/print themselves somewhere) or they will end unsuccessfully (at which point they do nothing else).

This same logic (with minor modifications) will also work on cyclic graphs, but checking for cycles becomes necessary. e.g. Is vertex Q already in the path? If so, don't bother going there again, because it's a cycle. And of course, if there is actually a cycle in valid path (e.g. I->Q->Z->Q->J), it's impossible to return all the paths, because there really will be an infinite number of them. (e.g. I->Q->Z->Q->Z->Q->Z->...Q->J)
Generalsocket Pin
Ni@m26-May-04 23:42
Ni@m26-May-04 23:42 
GeneralRe: socket Pin
toxcct27-May-04 23:43
toxcct27-May-04 23:43 
GeneralRe: socket Pin
kmcguire28-May-04 3:35
kmcguire28-May-04 3:35 
GeneralRe: socket Pin
neurorebel6-Jun-04 22:11
neurorebel6-Jun-04 22:11 
Generalconsole timer Pin
nikoladsp26-May-04 23:03
nikoladsp26-May-04 23:03 
GeneralThe VC++ 2003 Toolkit Pin
--BoB--25-May-04 18:23
suss--BoB--25-May-04 18:23 
GeneralCall proc inside namespace from outside the namespace Pin
Member 62566624-May-04 8:41
Member 62566624-May-04 8:41 
GeneralRe: Call proc inside namespace from outside the namespace Pin
kmcguire30-May-04 17:28
kmcguire30-May-04 17:28 
GeneralTaking input while in some form of waiting/sleeping -- plz help Pin
Makutu21-May-04 20:32
Makutu21-May-04 20:32 
GeneralRe: Taking input while in some form of waiting/sleeping -- plz help Pin
Curi0us_George27-May-04 19:19
Curi0us_George27-May-04 19:19 
GeneralRe: Taking input while in some form of waiting/sleeping -- plz help Pin
Makutu2-Jun-04 15:20
Makutu2-Jun-04 15:20 
GeneralRe: Taking input while in some form of waiting/sleeping -- plz help Pin
Curi0us_George3-Jun-04 2:03
Curi0us_George3-Jun-04 2:03 
Generalneed help !! Pin
ormax321-May-04 9:09
sussormax321-May-04 9:09 
GeneralRe: need help !! Pin
kmcguire3-Jun-04 11:41
kmcguire3-Jun-04 11:41 
Generalborland c++builder vs C++(general) Pin
Andy Gunn20-May-04 22:28
Andy Gunn20-May-04 22:28 
GeneralFormatted Printing from RichTextBox class Pin
Tank_Aviator20-May-04 7:13
Tank_Aviator20-May-04 7:13 
Generalamazon upload need help... Pin
Sumit Kapoor19-May-04 19:57
Sumit Kapoor19-May-04 19:57 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.