class Edge;
class MTPGraph {
- void initialize_work_lengths();
- void update_work_length();
+ void initialize_work_lengths_with_min();
+ void update_work_lengths();
+ void force_positive_work_lengths();
void find_shortest_path(Vertex **front, Vertex **new_front);
+ Vertex **_front, **_new_front;
+
int _nb_vertices, _nb_edges;
- Edge *edge_heap;
- Vertex *vertices;
- Vertex *source, *sink;
+ Vertex *_source, *_sink;
+
+ Edge *_edges;
+ Vertex *_vertices;
+
public:
+
MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
int source, int sink);
void find_best_paths(scalar_t *lengths, int *result_edge_occupation);
void print();
+ void print_dot();
};
-void dot_print(int nb_vertices,
- int nb_edges, int *ea, int *eb, scalar_t *el,
- int source, int sink,
- int *edge_occupation);
-
#endif