|
i have always thought VB programmers are slightly Dim 
|
|
|
|
|
Hello Everybody,
I have a network and I want to find diffrent and multiple paths in this network.
I have try dfs ,bfs, aco but still they are getting only one solution.
so pls help.
Thanks
If you can think then I Can.
|
|
|
|
|
Then there is only one solution, or an error in your algorithms. DFS and BFS, if run to completion, will find all the paths.
|
|
|
|
|
how to write codings for sram by using enhanced canary based system for power reduction
|
|
|
|
|
|
Possibly by reading some of the journals listed here[^].
|
|
|
|
|
Wibble hatstand?
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
|
how to write c codings for ant colony algorithm by using floorplanning
|
|
|
|
|
You could start by checking out Google.[^]
It's truly amazing what information can be found.
I wasn't, now I am, then I won't be anymore.
|
|
|
|
|
Hello Experts,
I have a road map where i have a starting point A and Destination Point Z. There are multiple ways From A to Z.
Then How can i Get How many Number of Possibilities to Move from A to Z.
Thanks
If you can think then I Can.
|
|
|
|
|
This is a well-explored problem in graph theory. Google for something like 'number of paths in graph'. That should get you lots of references ranging from trivial to PhD material.
Cheers,
Peter
Software rusts. Simon Stephenson, ca 1994.
|
|
|
|
|
|
Without your being more specific about your goals, and the problem, I don't think much can be said.
Most real-world examples of combinatorial optimization have constraints ... without which you have potentially infinite recursion.
For example ... assuming by "road map" you mean, literally, a map of highways, streets ... you would certainly not want to find combinations that are possible, but that involve doubling-back and repeating segments of the journey.
Are you trying to determine the shortest possible route ?
You may want to look at the infamous "travelling salesman" problem[^], where an attempt is made to find the shortest route which passes once through each city of a list of cities.
best, Bill
"Is it a fact - or have I dreamt it - that, by means of electricity, the world of matter has become a great nerve, vibrating thousands of miles in a breathless point of time? Rather, the round globe is a vast head, a brain, instinct with intelligence!" - Nathanial Hawthorne, House of the Seven Gables
|
|
|
|
|
Hi,
this is my first post on this forum.
First a Short intro to the Self Organizing Map
A Self Organizing Map (SOM) ,-sometimes called a Kohonen network-, maps multidimensional data onto a two dimensional map. A classic example is to classify colors by the Red, green and Blue (RGB) values. So if we have a large (10 000) set of randomly chosen colors, with different shades of, greens, reds, blues, pinks, etc. the SOM can map them on a 2-dimensional map where similar colors tend to end up on the same node on the map. If we chose a map with the dimensions 5 by 5 we get a map with 25 nodes. As an example the pink shades might end up in one corner of the map close to violet shades and the violets close to blue shades and so on. So similar colors tend to be close to each other. So if we wanted to classify those 10 000 colors in our dataset into 25 classes we could look at each colors node and use the information to se what class each of the colors belong to.
But how can we create clusters of several nodes based on their similarity to each other?
modified on Thursday, August 18, 2011 9:19 AM
|
|
|
|
|
SharpSim wrote: this is my first post on this forum.
And, as it seems, most probably the last ! 
|
|
|
|
|
Sometimes I get the impression that CodeProject is a forum of uneducated people.
|
|
|
|
|
WOw, are you stuck somewhere in the time-space of last week ?
|
|
|
|
|
This question may be more suited in this forum.
<a
href="http: www.codeproject.com="" forums="" 326859="" algorithms.aspx"="">http://www.codeproject.com/Forums/326859/Algorithms.aspx[^]
Regards
[Edit]
Fix link.
It was broke, so I fixed it.
modified on Thursday, August 18, 2011 7:58 AM
|
|
|
|
|
S Houghtelin wrote: This question may be more suited in this forum.
<ahref="http: www.codeproject.com="" forums="" 326859="" algorithms.aspx"="">http://www.codeproject.com/Forums/326859/Algorithms.aspx[^]
Can we move the question to that forum?
|
|
|
|
|
|
I knew it. I did not, but I knew someone would !
|
|
|
|
|
You forgot to chill it using Liquid Nitrogen.
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
Seconded. Motion is passed.
|
|
|
|
|
What an interesting question, well I think that a Self Organizing Map should ............ oh shiny! or in my case .... hmm chocolate! 
Ali
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
