Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

adapters-shortest-paths

Compare

  Analyzed about 1 year ago

Adapters for Java implementations of algorithms for routing the shortest paths between two vertices/nodes/points in a directed weighted graph without multiple edges between the same two vertices. The resulting paths must not have any loops/cycles i.e. must not visit the same vertex more than once ... [More] within the same path. The resulting paths do not have to be disjoint. Neither edge-disjoint nor vertex-disjoint. In other words it is okay that the same edge or vertex exist in different paths. The license for the core project is MIT but the adapee/adapter libraries licensed in the same way as the corresponding original Java code i.e. Apache 2.0 license. [Less]

38.8K lines of code

1 current contributors

almost 3 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

adapters-shortest-paths-dotnet

Compare

  Analyzed about 1 year ago

Adapters for C#.NET implementations of algorithms for routing the shortest paths between two vertices/nodes/points in a directed weighted graph without multiple edges between the same two vertices. The resulting paths must not have any loops/cycles i.e. must not visit the same vertex more than ... [More] once within the same path. The resulting paths do not have to be disjoint. Neither edge-disjoint nor vertex-disjoint. In other words it is okay that the same edge or vertex exist in different paths. The license for the core project is MIT but the adapee/adapter libraries licensed in the same way as the corresponding original Java code i.e. Apache 2.0 license. [Less]

40.3K lines of code

1 current contributors

over 4 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This