Tags : Browse Projects

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]