Databases
StackOverflow2013
Postsdbo
POHow do I avoid changing the Stack Size AND avoid getting a Stack Overflow in C#
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POHow do I avoid changing the Stack Size AND avoid getting a Stack Overflow in C#
    primarykey
    data
    text
    <p>I've been trying to find an answer to this question for a few hours now on the web and on this site, and I'm not quite there.</p> <p>I understand that .NET allocates 1MB to apps, and that it's best to avoid stack overflow by recoding instead of forcing stack size. </p> <p>I'm working on a "shortest path" app that works great up to about 3000 nodes, at which point it overflows. Here's the method that causes problems:</p> <pre><code> public void findShortestPath(int current, int end, int currentCost) { if (!weight.ContainsKey(current)) { weight.Add(current, currentCost); } Node currentNode = graph[current]; var sortedEdges = (from entry in currentNode.edges orderby entry.Value ascending select entry); foreach (KeyValuePair&lt;int, int&gt; nextNode in sortedEdges) { if (!visited.ContainsKey(nextNode.Key) || !visited[nextNode.Key]) { int nextNodeCost = currentCost + nextNode.Value; if (!weight.ContainsKey(nextNode.Key)) { weight.Add(nextNode.Key, nextNodeCost); } else if (weight[nextNode.Key] &gt; nextNodeCost) { weight[nextNode.Key] = nextNodeCost; } } } visited.Add(current, true); foreach (KeyValuePair&lt;int, int&gt; nextNode in sortedEdges) { if(!visited.ContainsKey(nextNode.Key) || !visited[nextNode.Key]){ findShortestPath(nextNode.Key, end, weight[nextNode.Key]); } } }//findShortestPath </code></pre> <p>For reference, the Node class has one member:</p> <pre><code> public Dictionary&lt;int, int&gt; edges = new Dictionary&lt;int, int&gt;(); </code></pre> <p>graph[] is:</p> <pre><code> private Dictionary&lt;int, Node&gt; graph = new Dictonary&lt;int, Node&gt;(); </code></pre> <p>I've tried to opimize the code so that it isn't carrying any more baggage than needed from one iteration (recursion?) to the next, but with a 100K-Node graph with each node having between 1-9 edges it's going to hit that 1MB limit pretty quickly. </p> <p>Anyway, I'm new to C# and code optimization, if anyone could give me some pointers (<a href="http://xkcd.com/138/" rel="nofollow noreferrer">not like this</a>) I would appreciate it.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USScott Dorman
    1. USNateD
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POHow do I avoid changing the Stack Size AND avoid getting a Stack Overflow in C#
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POHow do I avoid changing the Stack Size AND avoid getting a Stack Overflow in C#
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POHow do I avoid changing the Stack Size AND avoid getting a Stack Overflow in C#
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload