Form unknown CodePlex user on Sunday, 13 May 2007 12:31:53
It is a DAG. I build a database schema representation as a graph. Vertexes are tables, edges are foreign key constraints.
I'm really illiterate on graph theory, hence why I'm asking if there is a way to find the critical path using the existing framework or if I have to modify one of the algorithms (DijkstraShortestPathAlgorithm perhaps) to do this. A DAG exactly represents my problem hence why I chose it.
As for the exact path, won't the DFS algorithm give me the shortest path to a node? Assuming, that I have multiple paths to a node, I need the critical path, not the shortest path.
fubar-coder
commented
6 years ago
Form unknown CodePlex user on Sunday, 13 May 2007 12:31:53
It is a DAG. I build a database schema representation as a graph. Vertexes are tables, edges are foreign key constraints.
I'm really illiterate on graph theory, hence why I'm asking if there is a way to find the critical path using the existing framework or if I have to modify one of the algorithms (DijkstraShortestPathAlgorithm perhaps) to do this. A DAG exactly represents my problem hence why I chose it.
As for the exact path, won't the DFS algorithm give me the shortest path to a node? Assuming, that I have multiple paths to a node, I need the critical path, not the shortest path.
Thank you.
-Nick