Menu
Menu
DaniWeb
Log In
Sign Up
Read
Contribute
Meet
Search
Search
About 1,000 results for
shortest
- Page 1
Re: Extracting values from capturing groups in regex
Programming
Software Development
2 Months Ago
by Reverend Jim
…', 'Roy', 'Allyson'] The expression `.+?` does a lazy match (returns the
shortest
possible string that matches the pattern.
Re: Extracting values from a regex match
Programming
Software Development
2 Months Ago
by Reverend Jim
The trick is to use lazy matching which matches the
shortest
possible string. html = '<tr align="right">&…
Shortest hex digit to binary conversion function
Programming
Software Development
10 Years Ago
by ponedelnik
//
Shortest
function to convert an ascii hex digit to binary // (assumes a valid hex digit 0-9, A-F, a-f) char asciihex2bin(char ascii) { if (ascii > 0x40) ascii += 9; return (ascii & 0x0F); }
help me(cpu scheduling)
Programming
Computer Science
19 Years Ago
by k1d
SHORTEST
-JOB-FIRST , PRIORITY , ROUND ROBIN I need the idea of each of the above algorithms as flow chart??? please help me :sad:
help me (scheduling)
Programming
Software Development
19 Years Ago
by k1d
SHORTEST
-JOB-FIRST , PRIORITY , ROUND ROBIN I need the idea of each of the above algorithms as flow chart??? please help me
Re: help with date subtraction
Programming
Software Development
17 Years Ago
by waynespangler
shortest
: TextBox1.Text = DateTime.Now.AddDays(-3)
Re: Your favorite poem ...
Community Center
Geeks' Lounge
16 Years Ago
by GrimJack
Shortest
poem FLEAS [INDENT]Adam Had'em[/INDENT] Actually, one of my favorites is Dylan Thomas' [INDENT]Do not go gentle into that good night, Old age should burn and rave at close of day; Rage, rage against the dying of the light. [/INDENT]
Re: Shortest hex digit to binary conversion function
Programming
Software Development
10 Years Ago
by David W
… 101 145 65 01100101 e 102 146 66 01100110 f */ //
Shortest
? function to convert an ascii hex digit (CHAR) // to *AN…
Re: Shortest path kind of problem...
Programming
Software Development
15 Years Ago
by ninjaneer
… by: 1) find a path to the cheese, set to '
shortest
' 2) find another (unique) path to cheese, test for 'shorter… than current
shortest
' 3) update '
shortest
' as needed 4) terminate after no new paths are… lots of other (more complex, and elegant) ways to find
shortest
path.
Shortest path kind of problem...
Programming
Software Development
15 Years Ago
by gregorynoob
…: [CODE] ##...# C###.. ...... .####. .....M [/CODE] i'm supposed to calculate the
shortest
amount of steps he needs to make to get to… find a good algorithm to find the
shortest
path. i've read about those
shortest
path things but i kinda don't…
Shortest Remaining Time
Programming
Software Development
14 Years Ago
by Benderbrau
…'m doing four different algorithms: First come first serve,
shortest
job next,
shortest
remaining time, and round robin. I've got the… first two down perfect, but I'm having trouble with
shortest
remaining time. So I've got two lists: arrive=[0…
Re: Shortest path algorithm with a maximum number of edges limit
Programming
Software Development
15 Years Ago
by Murtan
So its not really a
shortest
path, its a 'cheapest' path, but with an edge limit. ….ahrgr.de/showAnimationDetails.php3?lang=en&anim=15]Dijkstra
Shortest
Path Algorithm[/url] or [url=http://www.graph-magics.com…
Shortest Path Around Obstacles?
Programming
Game Development
16 Years Ago
by Septenary
…://www.NightTowers.com/private/SamplePath3.gif[/img] Or, whatever the
shortest
path around the obstacles happens to be. I want the… object to be able to find the [I]
shortest
[/I], "smartest" path [I]before[/I] it actually…
Re: Shortest path kind of problem...
Programming
Software Development
15 Years Ago
by ruggedrat
… graphs are concerned, a bfs should suffice to find the
shortest
path between two nodes. It should probably look something like…
Re: Shortest path kind of problem...
Programming
Software Development
15 Years Ago
by skatamatic
… for each one. Then have a loop to find the
shortest
of the group. I think I'll try and write…
Re: Shortest path kind of problem...
Programming
Software Development
15 Years Ago
by titaniumdecoy
Like ruggedrat said, a breadth first search will suffice. Starting at M, mark each reachable node as distance 1; from those nodes, mark each reachable node [i]that has not already been visited[/i] as distance 2; etc: [CODE]##765# C###43 765432 6####1 54321M[/CODE] The
shortest
path is 8.
Shortest path algorithm with a maximum number of edges limit
Programming
Software Development
15 Years Ago
by blackslither
Hi I'm looking for a "
shortest
path algorithm" , but with a maximum number of edges … has to contain at most N edges . i've found
shortest
path algorithms but not with a number of edges limit…
Re: Shortest path algorithm with a maximum number of edges limit
Programming
Software Development
15 Years Ago
by blackslither
… want an algorithm that will return longer paths if the
shortest
path has too many edges? Is the longer path likely… edges and cost 66 ., and the limit N=6 . The
shortest
path is the one with the cost 66 , because the…
Re: Shortest path algorithm with a maximum number of edges limit
Programming
Software Development
15 Years Ago
by BestJewSinceJC
… end up with a 'trail' of visited Nodes in your
shortest
path. This means that when you program it, you're… essentially keeping track of each Node on the
shortest
path. But if I remember correctly, you're not keeping…
Shortest Path
Programming
Software Development
14 Years Ago
by NT.
… whether it is really like that or not. Calculating a
shortest
path on a graph can be done either using dijkstra… and nodes in the other and final product gives you
shortest
distance. I am not sure this is what it meant…
Re: Shortest Path
Programming
Software Development
14 Years Ago
by sneaker
When you want to find
shortest
path between all pairs of corners you can use matrix multiplication where the result is a matrix[B] D[/B] = [B]d[/B]ij where [B]d[/B]ij is the
shortest
path from corner [B]v[/B]i to corner [B]v[/B]j.
Re: Shortest Path
Programming
Software Development
14 Years Ago
by NT.
[QUOTE=sneaker;996341]When you want to find
shortest
path between all pairs of corners you can use matrix multiplication where the result is a matrix[B] D[/B] = [B]d[/B]ij where [B]d[/B]ij is the
shortest
path from corner [B]v[/B]i to corner [B]v[/B]j.[/QUOTE] Thanks for the explanation!!!
shortest path algorithm
Programming
Software Development
13 Years Ago
by hatzi8
I need an advice about the algorithm I have to use in order to find and return the
shortest
path in a graph like the one I uploaded. I'm lloking for the
shortest
path between two points, the lower left and the upper right. Thanks
Shortest Job Next Scheduling code logic help
Programming
Computer Science
11 Years Ago
by supas14
I'm trying to write code to simulate the
shortest
job next or
shortest
process next using bash and I'm having some…
Re: Shortest path algorithm with a maximum number of edges limit
Programming
Software Development
15 Years Ago
by Murtan
Are you saying that you want an algorithm that will return longer paths if the
shortest
path has too many edges? Is the longer path likely to have fewer edges?
Shortest Job First Preemptive
Programming
Software Development
14 Years Ago
by ahmedshayan
… need of help... I were to create Operating System's
Shortest
Job First Preemptive Algorithm .... The problem is that I am…
Shortest way
Programming
Software Development
14 Years Ago
by chathuD
…) { MessageBox.Show(ex.Message.ToString()); throw; } [/CODE] IS THIS THE
SHORTEST
WAY TO DO THIS KIND OF THING
Shortest path using queue
Programming
Software Development
13 Years Ago
by need
Hello, The program finds the
shortest
path between the user inputted nodes. The nodes are integer. …
Shortest pairs problem. Longitude / Latitude, to x,y coordinates?
Programming
Software Development
12 Years Ago
by thompsonSensibl
…]. The goal is to find the two cities with the
shortest
distance. I have an algorithm which, given the geographical locations…
Shortest Path Algorithm
Programming
Software Development
12 Years Ago
by ziadkassam
Hi, please, I want the
shortest
path algorithm using arrays (Data structure) and the path passing through all the points once and return back to the initial point. ex: 0-1-4-2-3-5-0 (path cost=10) 0-3-2-5-4-1-0 (path cost=15) so 0-1-4-2-3-5-0 is the correct answer.
1
2
3
17
Next
Last
Search
Search
Forum Categories
Hardware/Software
Programming
Digital Media
Community Center
Latest Content
Newest Topics
Latest Topics
Latest Posts
Latest Comments
Top Tags
Topics Feed
Social
Meet People
Forums
Top Members
Community Functions
DaniWeb Premium
Newsletter Archive
Markdown Syntax
Community Rules
Developer APIs
Connect API
Forum API Docs
Tools
SEO Backlink Checker
Legal
Terms of Service
Privacy Policy
FAQ
About Us
Advertise
Contact Us
© 2024 DaniWeb® LLC