SuperNetObjects is a set of object software developed for geographic network analysis. It can define, store, switch and analyze various kinds of network analyses for program developers via program languages of Windows environment. Besides, you can embed network analysis functions to your application programs and develop different application systems via SuperNetObjects, for example, asset, education, agriculture, telecommunication, banking, health insurance, emergency reaction, utilities, interior department and enterprise locations.

• It is operable in Windows 2000/XP/2003/Vista OS platform environments for program development.
• 32 bites Windows Dynamic Linking Library (DLL) enables program developers to develop required GIS application programs in general developing environments (e.g. Visual Basic, Visual Basic for Applications, Delphi, Visual C++, Visual Fox pro, Visual Studio.NET, Borland C++ Builder, PowerBuilder).
• Vector layers in *.shp and *.geo are supported.
• Built-in Map Control components enable developers to display network analysis result on the map object.
• Object-oriented structure and complete On-line Help
• Chinese program developing descriptive documents are provided.
  

• Optimal data structures and methods to search and analyze intersected networks are provided.
• Users can efficiently conduct and manage the huge network system via specific network process and management models.
• Users can insert point features and input point layers (Geo, Shapefile) to be flags, barriers or vehicle points.
• Users can save all flags, barriers or vehicle points as new files.
• Searching the shortest path between two points or multiple points is provided. The cost matrix is calculated and output as a text file.
• In superior route planning, users can determine how to plan the route, such as following the assigned order, assigning destination or returning to the destination.
• In vehicle routing issue, the best route planning is provided according to vehicles attributes and users’ requests.
• The algorithm for searching nearest facilities can search one or several nearest facilities from the start point.
• The algorithm for searching service range can display the reachable range within the specific distance or time from the start point.
• Minimum spanning tree is able to calculate minimum total distance covering all selected points of tree network.
• In center problem, the center point can be selected from several selected points.
• In median problem, the median point can be selected among several selected points.
• Set up barriers and automatically keep away from the segment in route planning.
• Set up speed limit of the segment to decide the shortest path or the fastest path as the priority of superior route planning.
• Users can set up Time Windows and loading limit of flags, which also takes flag’s demand into consideration instead of considering time and distance cost only.
• In superior route planning and vehicle routing problem, users can select algorithm from nearest neighbor, farthest insertion, sweep, annealing simulation and genetic algorithm for solutions.
• Set up connectivity of two intersected segments and entrance availability, like no left turn.
• Set up intersection cost to reduce turning frequency.
• Different weight files can be input in route planning, and users can set up weight under different conditions.
• Users can assign threshold values of turning left and right and calculate turn type as the data is being converted.