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;
Vertex *_source, *_sink;
- Vertex **_front, **_new_front;
+
+ Edge *_edges;
+ Vertex *_vertices;
+
public:
- Edge *edges;
- Vertex *vertices;
MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
int source, int sink);