equal
deleted
inserted
replaced
56 // pn = dfs_test.predNodeMap(); |
56 // pn = dfs_test.predNodeMap(); |
57 b = dfs_test.reached(n); |
57 b = dfs_test.reached(n); |
58 |
58 |
59 } |
59 } |
60 |
60 |
|
61 |
|
62 void check_Dfs_Function_Compile() |
|
63 { |
|
64 typedef int VType; |
|
65 typedef concept::StaticGraph Graph; |
|
66 |
|
67 typedef Graph::Edge Edge; |
|
68 typedef Graph::Node Node; |
|
69 typedef Graph::EdgeIt EdgeIt; |
|
70 typedef Graph::NodeIt NodeIt; |
|
71 typedef concept::ReadMap<Edge,VType> LengthMap; |
|
72 |
|
73 dfs(Graph(),Node()).run(); |
|
74 dfs(Graph()).source(Node()).run(); |
|
75 dfs(Graph()) |
|
76 .predMap(concept::WriteMap<Node,Edge>()) |
|
77 .distMap(concept::WriteMap<Node,VType>()) |
|
78 .reachedMap(concept::ReadWriteMap<Node,bool>()) |
|
79 .processedMap(concept::WriteMap<Node,bool>()) |
|
80 .run(Node()); |
|
81 |
|
82 } |
|
83 |
61 int main() |
84 int main() |
62 { |
85 { |
63 |
86 |
64 typedef SmartGraph Graph; |
87 typedef SmartGraph Graph; |
65 |
88 |