23,930 reputation
755141
bio website steveevers.wordpress.com
location Bellevue, WA
age 32
visits member for 4 years, 2 months
seen Nov 24 at 9:56

Currently:

Software Development Engineer in Test (SDET)

Interests:

  • AI
  • Computational Behaviour
  • C#, F#

Jan
27
revised Log design approach
added 988 characters in body
Jan
27
comment How should a senior programmer monitor another senior programmer?
+1. On the topic of positive feedback: studies (don't have access to them ATM) show that it takes a ~4:1 ratio of positive feedback to negative feedback for people to even remember that they received positive feedback.
Jan
20
comment What algorithm should I use to find the shortest path in this graph
Very true! My mistake.
Jan
19
revised Notifying multiple listeners
added 22 characters in body
Jan
19
comment What algorithm should I use to find the shortest path in this graph
DFS (or, slightly more complicated, iterative DFS) doesn't run into the memory issues that arise using BFS on some types of graphs. It also depends on the characteristics and expectations of the graph/data though.
Jan
19
reviewed Reject suggested edit on mvp tag wiki excerpt
Jan
19
reviewed Approve suggested edit on mvp tag wiki
Jan
17
comment Algorithm for defragmenting cross-pipe issues in a network for routing signals through?
As far as I know (and TBH, I'm not an expert here, it's a recent area of interest of mine) 1. most of the algorithms work with directed graphs 2. separate sinks on the same graph sounds problematic with the textbook/canonical algorithms
Jan
17
comment Algorithm for defragmenting cross-pipe issues in a network for routing signals through?
Have you looked into max-flow algorithms? (en.wikipedia.org/wiki/Maximum_flow_problem)
Jan
17
comment Can one become good programmer by self learning or a mentor is needed?
@RobertHarvey That's a shame. A good mentor can be as simple as a smart smoking buddy that likes to talk shop.
Jan
17
comment Can one become good programmer by self learning or a mentor is needed?
@RobertHarvey In 30 years, you've never had someone use their experience to guide you to finding solutions on a semi-regular basis?
Jan
17
comment How to simulate a REST API?
@dferraro: What's stopping you from polling the service the next time there's a game, and dumping that data to a file. Once you're capable of doing that, and are familiar with the format, then you can make a new file (or files) with specific test cases.
Jan
11
comment Best way to keep large amounts of data (no relational database needed)
How large is large (MB/GB/TP/PB)? What's the growth rate like (GB/Day)? Theoretically all DBs can grow infinitely, but few ever actually do. You might just need to better normalize your data and not actually have to worry about growth for a long time.
Jan
10
comment What graph traversal algorithm should I use?
@NKK: You might be out of your depth. That's a good place to be so that you can grow, but you might be better served hitting the books and reading a good data structures/algorithms text that covers graphs and pathfinding.
Jan
9
reviewed Approve suggested edit on laravel tag wiki excerpt
Jan
9
reviewed Approve suggested edit on laravel tag wiki
Jan
9
comment Best way of validating Class properties
@JonRaynor The general problem is data cleaning and for small volumes of data and small frequencies of this process, I'd clean the remaining data manually on a case-by-case basis. If the OP's scenario is not a one-off then this this exercise is (or had better be) a stop-gap for a b2b service that accepts strongly typed information. Dumping to CSV strings is not a reliable long term business process.
Jan
9
answered Best way of validating Class properties
Jan
8
comment What graph traversal algorithm should I use?
I think the issue is that OP has a list of nodes that represent points on a graph, but no edges, and is trying to build out the graph's edges. OP: If you know how to determine if a node is traversable from another node, and the graph will be relatively sparse, then an O(n^2) brute force can generate all of your edges in short order.
Jan
8
comment What graph traversal algorithm should I use?
In your scenario, the pathfinder (agreed on A*) would have to have a special case for the specific high weight to cover the scenario where no traversable path exists but the graph is still connected.