Abstract: In this work, finding or prediction of most influential person using machine learning models is examined and com- pared. The twitter or other social media datasets are analysed using linear ...

Abstract: With the development of artificial intelligence algorithm, the combination of intelligent algorithm and directed graph has become an important tool of current path planning. The application ...

Imagine balancing a ruler vertically in the palm of your hand: you have to constantly pay attention to the angle of the ruler and make many small adjustments to make sure it doesn't fall over. It ...

Expander decompositions are well-established as a central tool in undirected graph algorithms, facilitating an avalanche of breakthrough results over the past two decades. Recently they have also ...

A program implementing the three shortest paths algorithms for directed weighted graphs which are Dijkstra, Bellman-Ford and Floyd-Warshall.

Enumeration of all Permutations (Recursion, Single Swap, and in Lexicographic Order), and Combinations. Enumeration of all Topological Orderings on a Directed Graph. Enumeration of all Paths in a ...