Changeset 1909:2d806130e700 in lemon-0.x for demo/topology_demo.cc
- Timestamp:
- 01/26/06 16:42:13 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2484
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/topology_demo.cc
r1875 r1909 44 44 45 45 void drawConnectedComponents() { 46 typedef UndirListGraph Graph;46 typedef ListUGraph Graph; 47 47 typedef Graph::Node Node; 48 48 … … 50 50 Graph::NodeMap<xy<double> > coords(graph); 51 51 52 U ndirGraphReader<Graph>("undir_components.lgf", graph).52 UGraphReader<Graph>("u_components.lgf", graph). 53 53 readNodeMap("coordinates_x", xMap(coords)). 54 54 readNodeMap("coordinates_y", yMap(coords)). … … 60 60 connectedComponents(graph, compMap); 61 61 62 graphToEps(graph, "connected_components.eps").u ndir().62 graphToEps(graph, "connected_components.eps").u(). 63 63 coords(coords).scaleToA4().enableParallel(). 64 64 parEdgeDist(20.0).edgeWidthScale(2.0).nodeScale(20.0). … … 98 98 99 99 void drawNodeBiconnectedComponents() { 100 typedef UndirListGraph Graph;100 typedef ListUGraph Graph; 101 101 typedef Graph::Node Node; 102 typedef Graph::U ndirEdge UndirEdge;102 typedef Graph::UEdge UEdge; 103 103 104 104 Graph graph; 105 105 Graph::NodeMap<xy<double> > coords(graph); 106 106 107 U ndirGraphReader<Graph>("undir_components.lgf", graph).107 UGraphReader<Graph>("u_components.lgf", graph). 108 108 readNodeMap("coordinates_x", xMap(coords)). 109 109 readNodeMap("coordinates_y", yMap(coords)). … … 112 112 ColorSet colorSet; 113 113 114 Graph::U ndirEdgeMap<int> compMap(graph);114 Graph::UEdgeMap<int> compMap(graph); 115 115 Graph::NodeMap<bool> cutMap(graph); 116 116 biNodeConnectedComponents(graph, compMap); 117 117 biNodeConnectedCutNodes(graph, cutMap); 118 graphToEps(graph, "bi_node_connected_components.eps").u ndir().118 graphToEps(graph, "bi_node_connected_components.eps").u(). 119 119 coords(coords).scaleToA4().enableParallel(). 120 120 parEdgeDist(20.0).edgeWidthScale(5.0).nodeScale(20.0). … … 127 127 128 128 void drawEdgeBiconnectedComponents() { 129 typedef UndirListGraph Graph;129 typedef ListUGraph Graph; 130 130 typedef Graph::Node Node; 131 typedef Graph::U ndirEdge UndirEdge;131 typedef Graph::UEdge UEdge; 132 132 133 133 Graph graph; 134 134 Graph::NodeMap<xy<double> > coords(graph); 135 135 136 U ndirGraphReader<Graph>("undir_components.lgf", graph).136 UGraphReader<Graph>("u_components.lgf", graph). 137 137 readNodeMap("coordinates_x", xMap(coords)). 138 138 readNodeMap("coordinates_y", yMap(coords)). … … 142 142 143 143 Graph::NodeMap<int> compMap(graph); 144 Graph::U ndirEdgeMap<bool> cutMap(graph);144 Graph::UEdgeMap<bool> cutMap(graph); 145 145 biEdgeConnectedComponents(graph, compMap); 146 146 biEdgeConnectedCutEdges(graph, cutMap); 147 147 148 graphToEps(graph, "bi_edge_connected_components.eps").u ndir().148 graphToEps(graph, "bi_edge_connected_components.eps").u(). 149 149 coords(coords).scaleToA4().enableParallel(). 150 150 parEdgeDist(20.0).edgeWidthScale(2.0).nodeScale(20.0). … … 156 156 157 157 void drawBipartitePartitions() { 158 typedef UndirListGraph Graph;158 typedef ListUGraph Graph; 159 159 typedef Graph::Node Node; 160 typedef Graph::U ndirEdge UndirEdge;160 typedef Graph::UEdge UEdge; 161 161 162 162 Graph graph; 163 163 Graph::NodeMap<xy<double> > coords(graph); 164 164 165 U ndirGraphReader<Graph>("partitions.lgf", graph).165 UGraphReader<Graph>("partitions.lgf", graph). 166 166 readNodeMap("coordinates_x", xMap(coords)). 167 167 readNodeMap("coordinates_y", yMap(coords)). … … 173 173 bipartitePartitions(graph, partMap); 174 174 175 graphToEps(graph, "bipartite_partitions.eps").u ndir().175 graphToEps(graph, "bipartite_partitions.eps").u(). 176 176 coords(coords).scaleToA4().enableParallel(). 177 177 parEdgeDist(20.0).edgeWidthScale(2.0).nodeScale(20.0).
Note: See TracChangeset
for help on using the changeset viewer.