pjotr

Prague, Czech Republic

n/a

Age: 33

ex-perlmonk

now in c#/asp.net exile

graph enthusiast

Apr
17
answered Ford-Fulkerson algorithm in a graph with links with weight 1
Apr
17
comment Logic Method From a LINQ to SQL expression
If the method is simple, how about using dynamic LINQ? See end of this article for example and explanation
Apr
17
revised Recognizing a topological graph in a noisy image
rewording
Apr
17
comment graph traversal - finding 2 shortest paths for 2 entities such they are never in contact (both at the same node)
The complexity should be d*V^2*E^2, because you need to try every combination of neigbors in every iteration. Also I'd mention the space complexity, which is often a drawback of DP solutions. Nevertheless, I think it's the best way to find the optimal solution for this problem, otherwise you'd have to settle for an approximation.
Apr
17
awarded Yearling
Apr
17
awarded Autobiographer
Apr
17
comment Recognizing a topological graph in a noisy image
This problem looks interesting, let me know if you need help with prototyping/implementing the solution
Apr
17
answered Recognizing a topological graph in a noisy image
Apr
17
comment Efficient implementation of bfs algorithm for a subgraph of a complete graph
Is it this problem again?
Apr
16
comment Selected array of keys from Dictionary using LINQ
Yes, this seems to be okay. Plus, I'd advise to return IEnumerable<string> from the GetHostList method instead of an array, let the caller materialize the result when he chooses to.
Apr
16
comment Trying to replace xml node value
You'd better post the actual XML, not this pretty-printed version, this way it's impossible to test what you've got. Anyway, it's most probable that you're missing namespace identifier in your query.
Apr
16
awarded Autobiographer
Apr
16
awarded Supporter
Apr
15
answered Graph with K5 minor contains K5 subdivision
Apr
12
answered Complete graph with only two possible costs. What's the shortest path's cost from 0 to N - 1
Apr
11
comment Updating a tree and keeping track of the change in the nodes of some subtree
Do you know all the operations beforehand, or do you need to do them one at a time?
Apr
11
comment How to make a dijkstra longest path?
Please, be more specific. What is your goal, with what do you need help?
Apr
11
revised How to make a dijkstra longest path?
code formatted
Apr
10
answered Bridges in an Undirected Graph
Apr
10
answered Linq: Elements not working when I have a namespace in XML file
1 2 3 4 5