Chapter 1. Introduction

In this chapter we provide an overview of the core features and the workflow of Rocs. For the eager reader, who wants to start using Rocs immediately, we suggest to read at least the section called “Rocs in a Nutshell” and using Chapter 3, Writing and Executing Algorithms in Rocs as a reference when writing algorithms.

Goals, Target Audience and Workflow

Rocs is a Graph Theory IDE for everybody interested in designing and analyzing graph algorithms. This explicitly includes

  • lecturers, who want to demonstrate algorithms to their students,

  • students, who want to understand and see how their algorithm perform,

  • and everybody, who is interested in data structures and algorithms.

For all these users, Rocs provides an easy to use data structure editor for creating the data structures, a powerful scripting engine to execute algorithms, and several helper tools for your simulations and experiments.

The typical workflow when using Rocs is to start by creating a graph with the visual graph editor. You can do this either by hand, this is adding data elements and connect them, or by using one of the data structure generators (if available for the currently selected data structure backend). Data structure generators can be found at Graph DocumentToolsGenerate Graph. Further, you can assign values to the data structure elements, either by hand or using Graph DocumentToolsAssign Values. Finally, you can write your algorithm in JavaScript and execute it with the just created data structure. All changes that your algorithm perform at the data structure will be directly visible at the visual graph editor.

A Screenshot of Rocs.