[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

symrcm implementation

From: Petr Pařík
Subject: symrcm implementation
Date: Wed, 12 Sep 2018 21:12:56 +0900
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:60.0) Gecko/20100101 Thunderbird/60.0

Hi all,

I am somewhat puzzled by the symrcm function implementation in Octave and I would appreciate any clarification.

In the attached example symrcm gives [92 91 93 ... 3 1 2], but how did it choose the starting node 2? The algorithm for finding the starting node starts with node 1 and then proceeds to find the most distant node using the breadth-first search, which might be one of 91, 92 & 93 (nodes on the last level). And looking at find_starting_node() in I really can't see any way it could return node 2, which is adjacent to node 1.

Please, what am I missing here?

Best regards,

Petr Parik

Attachment: sample.m
Description: Text Data

reply via email to

[Prev in Thread] Current Thread [Next in Thread]