12 |
# This program is distributed in the hope that it will be useful, |
# This program is distributed in the hope that it will be useful, |
13 |
# but WITHOUT ANY WARRANTY; without even the implied warranty of |
# but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
# GNU General Public License for more details. |
# GNU Affero General Public License for more details. |
16 |
# |
# |
17 |
# You should have received a copy of the GNU Affero General Public License |
# You should have received a copy of the GNU Affero General Public License |
18 |
# along with this program. If not, see <http://www.gnu.org/licenses/>. |
# along with this program. If not, see <http://www.gnu.org/licenses/>. |
95 |
|
|
96 |
# 1. calculate paths |
# 1. calculate paths |
97 |
print '-' * 42 |
print '-' * 42 |
98 |
print " Finding paths from node %s to %s" % (source_node.id, target_node.id) |
print " Finding paths from %s to %s (depth=%s)" % (source_node.id, target_node.id, MAX_SEARCH_DEPTH) |
99 |
print '-' * 42 |
print '-' * 42 |
100 |
paths = graph.computePaths(source_node, target_node, MAX_SEARCH_DEPTH) |
paths = graph.computePaths(source_node, target_node, MAX_SEARCH_DEPTH) |
101 |
|
|