Press escape to exit fullscreen

{{sketch.instructions}}

CC {{sketch.licenseObject.short}}

Archived Sketch

This sketch is created with an older version of Processing,
and doesn't work on browsers anymore.

View Source Code

Capture Screenshot

One Graph and Many Paths / Un graphe et des chemins

{{$t('general.by')}}
fuscia.info
This interface is about graphs theory and deals with its basic concepts. We introduce the Dijkstra's algorithm which is a graph search algorithm that finds the path with lowest cost (i.e. the shortest path) between a given vertex and every other vertex. Graph theory is applied on the case of a social network (a group of friends which are not all connected). The interface is in french. Project by Cécile Picard-Limpens (http://www-sop.inria.fr/members/Cecile.Picard/), coordinated by FUSCIA (http://www.fuscia.info/) / INRIA, and financially supported by UNISCIEL (http://www.unisciel.fr/).
We recovered an unsaved version of this sketch. Please review your changes below.

As a Plus+ Member feature, this source code is hidden by the owner.

  • {{co.title}}
    •
    {{$t('sketch.mode-pjs')}} {{$t('general.learnMore')}}
    Select mode or a template
    {{liveCodeLink}}
    • {{l.url.substr(l.url.lastIndexOf('/') + 1)}}
    {{$t('sketch.layoutDescription')}}

    {{k.category}}
    {{k.label}}
    {{k.description}}

    {{$t('sketch.seeMoreShortcuts')}}

    Versions are only kept for 7 days.
    Join Plus+ to keep versions indefinitely!

    {{$t('general.joinPlus')}}

    {{$t('sketch.versionsSummarized')}}

    {{ $t('general.joinPlus') }}