Search DaniWeb - edges

implementing Deapth First Search (non recursively) 10 Years Ago by mum.roy.77 edges.txt is used.it is the input adjacency list. 1 …; int num1,num2; int i=0,j; fp=fopen("edges.txt","r"); while(fscanf(fp,"%d… Re: Shortest path algorithm with a maximum number of edges limit 15 Years Ago by Murtan … specified length, or to 'modify the cost' of edges beyond the limit to make them appear cost prohibitive. …problem is: [LIST=1] [*]The list of nodes [*]The edges (connections between nodes) and their costs [*]The maximum number …more paths from) nodes that it already takes N edges to reach: [url=http://www.animal.ahrgr.de/showAnimationDetails… Re: Shortest path algorithm with a maximum number of edges limit 15 Years Ago by blackslither … the shortest path has too many edges? Is the longer path likely to have fewer edges?[/QUOTE] every edge has a cost… minum cost that has at most N edges . So if a path has 7 edges and cost 60 , and another path has… 5 edges and cost 66 ., and the limit N… monitor display stretched in the middle and narrow on the edges 14 Years Ago by pancaeks … the center, and too narrowed on the edges, so when i try to move something …the screen, and appears too narrow on the edges of the screen. also, the display was…cant see the rest of the display (the edges, such as scrollbars, the X button, etc… then above problem happened (stretched center, narrowed edges). i attached a screenshot to help. i asked… Shortest path algorithm with a maximum number of edges limit 15 Years Ago by blackslither …;shortest path algorithm" , but with a maximum number of edges limit . So the path has to contain at most N… edges . i've found shortest path algorithms but not with a …number of edges limit , and i've tried to modify A* , Bellman-Ford… Re: Shortest path algorithm with a maximum number of edges limit 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? Re: Shortest path algorithm with a maximum number of edges limit 15 Years Ago by Murtan … process nodes if they would lead to a too many edges solution) could be 'led astray' with the right structure. If… Re: Shortest path algorithm with a maximum number of edges limit 15 Years Ago by BestJewSinceJC And my point is that Dijkstra's algorithm does not *know* how many edges are on the path until it is finished, so modifying it would not make sense. Am I wrong? Re: Shortest path algorithm with a maximum number of edges limit 15 Years Ago by Murtan … the node been processed (visited) [*]List of Routing Info: [LIST] [*] edges to here [*] cost to here [*] previous node [/LIST] [/LIST] We… maintain smooth edges of text box 14 Years Ago by sureronald … perfectly but I would like to maintain the smooth rounded edges of the default text input box since when the formatting… the input box simply becomes a rectange with 90 degree edges. Thanks Horizontally distribute DIVs or blocks between two edges 12 Years Ago by guyinpv … four boxes of content distributed between the left and right edges of that space. To get a few obvious solutions out… is imprecise and won't align between left and right edges before the floated boxes stack on each other. In fact… Photographic edges 3.0 FOR MAC 18 Years Ago by woderu I'm Looking For An Old Version Of Photographic Edges For Mac. Version 3.0 To Be Exact. That Version Worked Great For Me And I Have A Newer Version For Osx But I Hate It And Auto Fx Said They Don't Have Older Version On Hand... So Can Anyone Help Me Out? Willing To Pay, Obviously. Thanks! Table with rounded edges 15 Years Ago by IamOnCloudNine Hello, Presently I'm working on a web form and I want to put a table in it with rounded edges. Can anyone suggest a way about how to do that? I don't want to use images for that purpose(like getting the four edge images with the same background color etc. etc.). Antialiased form edges? 14 Years Ago by ShawnH I'm currently using the old SetWindowRgn method to create a form with rounded corners but the edges of the corners produced are horribly pixelated. Is there any way to have a form with rounded corners that are smooth? how to use JUNG to color & shape vertices and edges 14 Years Ago by sumitweb … the vertices will be having different shapes and colors and edges will be dashed or full line in different colors. Since… Purple / green edges on vertical lines of text (LCD monitor) 13 Years Ago by mahela007 … contrast settings of the monitor are increased, the left vertical edges of letters seem to have a purple tinge. This is… Rounded edges with one circle image 12 Years Ago by veledrom Hi, I have a transparent circle (20X20) in PNG format. I want to use it to make a DIV or TABLE with rounded edges. How can I do it with CSS? I tried with some examples but none of them were cross-browser compatible. Thanks Smooth edges on borderless form - need help 11 Years Ago by nesa24casa Hello, i have created borderless form with transparent png as bacground image but i have issue. Border edges isnt smooth [image](http://www.tuxmachines.org/images/openoffice_31_antialias.png) Its like in this picture on the left and i need it to be smooth. How can i make it smooth? Thanks in advance chars and pointers and all that fun stuff 18 Years Ago by jhdobbins …; endl; edges[0].from = 'a' ; edges[0].to = 'c'; edges[0].searched = false; edges[1].from = 'b' ; edges[1].to = 'd'; edges[1].searched = false; edges[2… = false; edges[10].from = 'h' ; edges[10].to = 'k'; edges[10].searched = false; edges[11].from = 'h' ; edges[11].to = 'l'; edges[11].searched = false; edges[12… Re: chars and pointers and all that fun stuff 18 Years Ago by jhdobbins …; endl; edges[0].from = 'a' ; edges[0].to = 'c'; edges[0].searched = false; edges[1].from = 'b' ; edges[1].to = 'd'; edges[1].searched = false; edges[2… = false; edges[10].from = 'h' ; edges[10].to = 'k'; edges[10].searched = false; edges[11].from = 'h' ; edges[11].to = 'l'; edges[11].searched = false; edges[12… Need URGENT help with Dijkstra's algorithm!! 13 Years Ago by modjoe …*(Vmax-1)/2; // Maximum number of edges class Graphs { public: //_____________________________________ // Member… (r,c,weight) in edges[i] edges[i].u = r; edges[i].v = c; edges[i].w = weight; i… { if(x==edges[k].u) j=edges[k].u; else j=edges[k].v; temp_weight=edges[k].w; }… help 17 Years Ago by alias47 …]) { int t=edges[j][1]; edges[j][1]=edges[j+1][1]; edges[j+1][1]=t; t=edges[j][2]; edges[j][2]=edges[j+1…][2]; edges[j+1][2]=t; t=edges[j][3]; edges[j][3]=edges[j+1…; if(p1!=p2) { tree[edges[i][1]][edges[i][2]]=edges[i][3]; tree[edges[i][2]][edges[i][1]]=edges[i][3]; // Mix the two… Prim's Algorithm for MST: File IO Error 13 Years Ago by r1409 …) { distanceMatrix[edges[i].from][edges[i].to ] = i; distanceMatrix[edges[i].to ][edges[i].from] = i; if (edges[i].from == at || edges[i].to == at) { edges[i… Re: chars and pointers and all that fun stuff 18 Years Ago by Dave Sinkula … rather than an assignment? [code]if (point [COLOR=Red]=[/COLOR] edges[x].from) {[/code] Re: chars and pointers and all that fun stuff 18 Years Ago by Dave Sinkula …=jhdobbins]and the reason why i did [CODE]if (point = edges[x].from) {[/CODE]was for the fact of... how do…] is written like this.[CODE]if (point =[COLOR=Blue]=[/COLOR] edges[x].from) {[/CODE]As you have it written, using an…[/I], the if will be true whenever [FONT=Courier New]edges[x].from[/FONT] is nonzero. [edit]This is not related… Find Logic for reading SQL data in VB.NET 14 Years Ago by sifar786 …) Default Group { nodes edges nodes edges (for G1 group) group{ nodes nodes nodes edges edges edges } (for G2 group) group{ nodes nodes nodes edges edges edges } } ......... [CODE] Imports… Need help in a java code 13 Years Ago by Me12 …; Graphics backg; int azimuth = 35, elevation = 30; Point3D[] vertices; Edge[] edges; Button okButton; //Button okButton1; CheckboxGroup radioGroup; Checkbox radio1; Checkbox radio2… ++j ) { g.drawLine( points[ edges[j].a ].x, points[ edges[j].a ].y, points[ edges[j].b ].x, points[ edges[j].b ].y ); } } public… Illegal Start of Expression 12 Years Ago by rezial …; int azimuth = 35, elevation = 30; Point3D[] vertices; Edge[] edges; public void init() { width = getSize().width; height = getSize().height…) { g.drawLine( points[ edges[j].a ].x, points[ edges[j].a ].y, points[ edges[j].b ].x, points[ edges[j].b ].y ); } … Help 12 Years Ago by rezial … elevation = 30; boolean down = false; Point3D[] vertices; Edge[] edges; public void init() { width = getSize().width; height = getSize().height… { g.drawLine( points[ edges[j].a ].x, points[ edges[j].a ].y, points[ edges[j].b ].x, points[ edges[j].b ].y ); }… Coloring a 3D Cube 12 Years Ago by rezial …elevation = 30; int scaleFactor = width/4; Point3D[] vertices; Edge[] edges; public void init() { width = getSize().width; height = getSize().… { g.drawLine( points[ edges[j].a ].x, points[ edges[j].a ].y, points[ edges[j].b ].x, points[ edges[j].b ].y ); }…