Opened 9 years ago

Closed 9 years ago

#8893 closed enhancement (fixed)

disjoint routed paths

Reported by: ncohen Owned by: jason, ncohen, rlm
Priority: minor Milestone: sage-4.5
Component: graph theory Keywords:
Cc: Merged in: sage-4.5.alpha1
Authors: Nathann Cohen Reviewers: Robert Miller
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Description (last modified by ncohen)

This patch implements the method disjoint_routed_path (k-DRP) which solves the following problem :

given a list of pairs s_i, t_i, find in a given graph a set of vertex-disjoints paths P_i such that P_i goes from s_i to t_i

Requires #8870

Attachments (1)

trac_8893.patch (2.4 KB) - added by ncohen 9 years ago.

Download all attachments as: .zip

Change History (6)

Changed 9 years ago by ncohen

comment:1 Changed 9 years ago by ncohen

  • Description modified (diff)
  • Status changed from new to needs_review

comment:2 Changed 9 years ago by ncohen

  • Description modified (diff)
  • Summary changed from disjoint rooted paths to disjoint routed paths

comment:3 Changed 9 years ago by ncohen

  • Priority changed from major to minor

comment:4 Changed 9 years ago by rlm

  • Authors set to Nathann Cohen
  • Reviewers set to Robert Miller
  • Status changed from needs_review to positive_review

comment:5 Changed 9 years ago by rlm

  • Merged in set to sage-4.5.alpha1
  • Resolution set to fixed
  • Status changed from positive_review to closed
Note: See TracTickets for help on using tickets.