Here in the above graph we are trying to find the longest distance between two vertices For example now say we consider vertices v_2 and v_4 in the above graph 

P_1 , P_2 ,P_3 are different possible path length in the above graph between v_2 and v_4  and it can be seen now the longest distance is 3 as it is the greatest among all lengths between v_2 and v_4

AllPathshortest only does the shortest path

can anyone help in the in general  finding the longest path between two vertices a graph if i give the

graph and the two vertices it should longest distance

here between v_2 and v_4 longest or greatest distance is 3 which should  greatest length of the several different paths between v_ 2 and v_4 itself

it should display that value.

kind help if anyone can

I their any way to use sagemath commands in my maplesoft program that want to use graph theory topological indices which in sagemath but i dont know if in maplesoft or anyone has create a package by any chance

i can see maple in sagemath in this url https://doc.sagemath.org/html/en/reference/interfaces/sage/interfaces/maple.html

but i want other way round sagemath in maple can anyone help as some packages in sage are not in maple i feel

kind help 

How to sort a matrix based on one particular column in that matrix

.  Has to sorted on column one only and output. . In this I have given only 2×2  it could be a n×n

Without too much code

I want to insert each row at a time into a excel sheet from a maple code .  But i dont want a new excel file created for each insert.

First my list L has say [(a,1),(a,2),(a,3),.....,(a,100)] 100 elements this is first i insert it into my excel first row
next  [(b,1),(b,2),(a,3),.....,(b,100)] 100 elements i should insert into excel second row and so on

but dont want to store them here on a rtable, vector,array "all together" then export

I justt store 1 row at a time insert it and do on the same excel file file dynamically. without creating multiple copies of the same file

can anyone help with a code using exceltools package or any

Suppose i have a set say

A={{"1"."8"},{"1","4"},{"1","10"}}

if i want to convert A to set such that {"{"1"."8"}","{"1","4"}","{"1","10"}"}  where each element is a string with minium time I have given a small set here i may have set with 48 to 100 such element that is s set of sets i want to convert the inside sets to strings without much of looping in minimum time can any one help