all simple paths problem

조회 수: 10(최근 30일)
Talaria
Talaria 2011년 7월 23일
  댓글 수: 1
Walter Roberson
Walter Roberson 2011년 7월 24일
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

댓글을 달려면 로그인하십시오.

채택된 답변

Andrew Newell
Andrew Newell 2011년 7월 24일
The package gaimc implements the breadth-first search mentioned in your NIST link. This might be a starting point for you. The remainder of the algorithm description in the NIST link sounds like reasonably straightforward bookkeeping.
  댓글 수: 2
Andrew Newell
Andrew Newell 2011년 7월 24일
If you click on the link for breadth-first search in the NIST link, you'll know as much as me.

댓글을 달려면 로그인하십시오.

추가 답변(0개)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by