如何解决复杂依赖关系排序问题？vaimo/topological-sort可以帮到你

<code class="php">use Vaimo\TopSort\StringSort;

$sorter = new StringSort();

$sorter->add('car1', ['owner1', 'brand1']);
$sorter->add('brand1');
$sorter->add('brand2');
$sorter->add('owner1', ['brand1']);
$sorter->add('owner2', ['brand2']);

$result = $sorter->sort();
// 输出结果将是：
// ['brand1', 'owner1', 'car1', 'brand2', 'owner2']</code>

<code class="php">use Vaimo\TopSort\GroupedStringSort;

$sorter = new GroupedStringSort();

$sorter->add('car1', 'car', ['owner1', 'brand1']);
$sorter->add('brand1', 'brand');
$sorter->add('brand2', 'brand');
$sorter->add('owner1', 'user', ['brand1']);
$sorter->add('owner2', 'user', ['brand2']);

$result = $sorter->sort();
// 输出结果将是：
// ['brand2', 'brand1', 'owner2', 'owner1', 'car1']

$groups = $sorter->getGroups();
// 输出分组信息：
// [
//   {type: 'brand', level: 0, position: 0, length: 2},
//   {type: 'user', level: 1, position: 2, length: 2},
//   {type: 'car', level: 2, position: 4, length: 1},
// ]</code>

<code>composer require vaimo/topological-sort</code>