A new path algorithm for the weighted multi-graphs WMGPA: application to the Direct Topological Method

TL;DR

This paper introduces a novel path algorithm for weighted multi-graphs designed to enumerate all possible paths between two nodes, facilitating applications in the direct topological method.

Contribution

The paper presents a new algorithm that efficiently finds all paths in weighted multi-graphs, specifically tailored for use in the direct topological method.

Findings

Algorithm successfully enumerates all paths in weighted multi-graphs.

Applicable to direct topological analysis in complex networks.

Enhances the computational tools for graph-based topological methods.

Abstract

The aim of this paper is to present an algorithm which gives all the possible paths that start from a specific node to another of a weighted multi-graph. This algorithm is intended to be applied for the direct topological method.