projects
/
mtp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Initial commit.
[mtp.git]
/
mtp_graph.h
diff --git
a/mtp_graph.h
b/mtp_graph.h
index
7b0f57d
..
0fad09d
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-19,16
+19,30
@@
#ifndef MTP_GRAPH_H
#define MTP_GRAPH_H
#ifndef MTP_GRAPH_H
#define MTP_GRAPH_H
+#include <iostream>
+#include <cmath>
+
+using namespace std;
+
#include "misc.h"
class Vertex;
class Edge;
#include "misc.h"
class Vertex;
class Edge;
+class Path {
+public:
+ Path(int l);
+ ~Path();
+ int length;
+ int *nodes;
+};
+
class MTPGraph {
class MTPGraph {
- void initialize_
work
_lengths_with_min();
- void update_
work
_lengths();
- void force_positiv
e_work
_lengths();
+ void initialize_
positivized
_lengths_with_min();
+ void update_
positivized
_lengths();
+ void force_positiv
ized
_lengths();
void find_shortest_path(Vertex **front, Vertex **new_front);
void find_shortest_path(Vertex **front, Vertex **new_front);
+ int retrieve_one_path(Edge *e, int *nodes);
Vertex **_front, **_new_front;
Vertex **_front, **_new_front;
@@
-40,14
+54,19
@@
class MTPGraph {
public:
public:
+ int nb_paths;
+ Path **paths;
+
MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
int source, int sink);
~MTPGraph();
MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
int source, int sink);
~MTPGraph();
- void find_best_paths(scalar_t *lengths, int *result_edge_occupation);
- void print();
- void print_dot();
+ void find_best_paths(scalar_t *lengths);
+ void retrieve_disjoint_paths();
+
+ void print(ostream *os);
+ void print_dot(ostream *os);
};
#endif
};
#endif