Tabnine Logo
PrepareContractionHierarchies.getTimesAsString
Code IndexAdd Tabnine to your IDE (free)

How to use
getTimesAsString
method
in
com.graphhopper.routing.ch.PrepareContractionHierarchies

Best Java code snippets using com.graphhopper.routing.ch.PrepareContractionHierarchies.getTimesAsString (Showing top 6 results out of 315)

origin: graphhopper/graphhopper

private void logStats(int updateCounter) {
  logger.info(String.format(Locale.ROOT,
      "nodes: %10s, shortcuts: %10s, updates: %2d, checked-nodes: %10s, %s, %s, %s",
      nf(sortedNodes.getSize()),
      nf(nodeContractor.getAddedShortcutsCount()),
      updateCounter,
      nf(checkCounter),
      getTimesAsString(),
      nodeContractor.getStatisticsString(),
      Helper.getMemInfo()));
}
origin: graphhopper/graphhopper

@Override
public void doSpecificWork() {
  allSW.start();
  initFromGraph();
  runGraphContraction();
  logger.info("took:" + (int) allSW.stop().getSeconds() + "s "
      + ", new shortcuts: " + nf(nodeContractor.getAddedShortcutsCount())
      + ", initSize:" + nf(initSize)
      + ", " + prepareWeighting
      + ", periodic:" + params.getPeriodicUpdatesPercentage()
      + ", lazy:" + params.getLastNodesLazyUpdatePercentage()
      + ", neighbor:" + params.getNeighborUpdatePercentage()
      + ", " + getTimesAsString()
      + ", lazy-overhead: " + (int) (100 * ((checkCounter / (double) initSize) - 1)) + "%"
      + ", " + Helper.getMemInfo());
  int edgeCount = prepareGraph.getOriginalEdges();
  logger.info("graph now - num edges: {}, num nodes: {}, num shortcuts: {}",
      nf(edgeCount), nf(prepareGraph.getNodes()), nf(prepareGraph.getEdges() - edgeCount));
}
origin: com.graphhopper/graphhopper-core

private void logStats(int updateCounter) {
  logger.info(String.format(Locale.ROOT,
      "nodes: %10s, shortcuts: %10s, updates: %2d, checked-nodes: %10s, %s, %s, %s",
      nf(sortedNodes.getSize()),
      nf(nodeContractor.getAddedShortcutsCount()),
      updateCounter,
      nf(checkCounter),
      getTimesAsString(),
      nodeContractor.getStatisticsString(),
      Helper.getMemInfo()));
}
origin: com.graphhopper/graphhopper-core

@Override
public void doSpecificWork() {
  allSW.start();
  initFromGraph();
  runGraphContraction();
  logger.info("took:" + (int) allSW.stop().getSeconds() + "s "
      + ", new shortcuts: " + nf(nodeContractor.getAddedShortcutsCount())
      + ", initSize:" + nf(initSize)
      + ", " + prepareWeighting
      + ", periodic:" + params.getPeriodicUpdatesPercentage()
      + ", lazy:" + params.getLastNodesLazyUpdatePercentage()
      + ", neighbor:" + params.getNeighborUpdatePercentage()
      + ", " + getTimesAsString()
      + ", lazy-overhead: " + (int) (100 * ((checkCounter / (double) initSize) - 1)) + "%"
      + ", " + Helper.getMemInfo());
  int edgeCount = ghStorage.getAllEdges().length();
  logger.info("graph now - num edges: {}, num nodes: {}, num shortcuts: {}",
      nf(edgeCount), nf(ghStorage.getNodes()), nf(prepareGraph.getAllEdges().length() - edgeCount));
}
origin: com.rgi-corp/graphhopper

    + ", shortcuts:" + Helper.nf(newShortcuts)
    + ", dijkstras:" + Helper.nf(dijkstraCount)
    + ", " + getTimesAsString()
    + ", meanDegree:" + (long) meanDegree
    + ", algo:" + prepareAlgo.getMemoryUsageAsString()
+ ", " + prepareWeighting
+ ", dijkstras:" + dijkstraCount
+ ", " + getTimesAsString()
+ ", meanDegree:" + (long) meanDegree
+ ", initSize:" + initSize
origin: com.graphhopper/graphhopper

    + ", shortcuts:" + Helper.nf(newShortcuts)
    + ", dijkstras:" + Helper.nf(dijkstraCount)
    + ", " + getTimesAsString()
    + ", meanDegree:" + (long) meanDegree
    + ", algo:" + prepareAlgo.getMemoryUsageAsString()
+ ", " + prepareFlagEncoder
+ ", dijkstras:" + dijkstraCount
+ ", " + getTimesAsString()
+ ", meanDegree:" + (long) meanDegree
+ ", initSize:" + initSize
com.graphhopper.routing.chPrepareContractionHierarchiesgetTimesAsString

Popular methods of PrepareContractionHierarchies

  • getWeighting
  • <init>
  • doWork
  • calculatePriority
    Calculates the priority of adjNode v without changing the graph. Warning: the calculated priority mu
  • close
  • contractNodes
  • initFromGraph
  • prepareNodes
  • addShortcuts
    Introduces the necessary shortcuts for adjNode v in the graph.
  • findShortcuts
    Finds shortcuts, does not change the underlying graph.
  • fromGraphHopperStorage
  • getCoords
  • fromGraphHopperStorage,
  • getCoords,
  • getOrigEdgeCount,
  • setLazyUpdates,
  • setLogMessages,
  • setNeighborUpdates,
  • setOrigEdgeCount,
  • setPeriodicUpdates,
  • createAStarBidirection

Popular in Java

  • Start an intent from android
  • setScale (BigDecimal)
  • runOnUiThread (Activity)
  • requestLocationUpdates (LocationManager)
  • URLConnection (java.net)
    A connection to a URL for reading or writing. For HTTP connections, see HttpURLConnection for docume
  • Enumeration (java.util)
    A legacy iteration interface.New code should use Iterator instead. Iterator replaces the enumeration
  • TreeSet (java.util)
    TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
  • Vector (java.util)
    Vector is an implementation of List, backed by an array and synchronized. All optional operations in
  • JLabel (javax.swing)
  • Project (org.apache.tools.ant)
    Central representation of an Ant project. This class defines an Ant project with all of its targets,
  • Top Vim plugins
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now