Hi, all,
I'v implememted a minimum arborescence algorithm for directed graph based on GDS in my Github project Neo4jWorks — Neo4j Graph Data Science Application Examples,
it's a java translation of David Eisenstat's Python implemention to the Chu-Liu/Edmond's algorithm. It applies to any type of directed network — bank account fund transfer networks in finance, invoice transaction fund networks in taxation, social networks, supply chain networks, etc, so I leave a message here for the convenience of anybody that maybe interested to read it.
Hi, all,
I'v implememted a minimum arborescence algorithm for directed graph based on GDS in my Github project Neo4jWorks — Neo4j Graph Data Science Application Examples,
it's a java translation of David Eisenstat's Python implemention to the Chu-Liu/Edmond's algorithm. It applies to any type of directed network — bank account fund transfer networks in finance, invoice transaction fund networks in taxation, social networks, supply chain networks, etc, so I leave a message here for the convenience of anybody that maybe interested to read it.