hcientist

About

This is a simple demonstration of the use of a constraint-based force layout to represent the dependency hierarchy. Subgraphs are not repeated as they are in the console rendering. As a result, we don't have to make any special provision for dependency cycles.

The Floyd-Warshall algorithm is used to display relative path distances. Floyd-Warshall has been extended with path reconstruction as well to show the shortest path solutions between nodes.

It is possible the display could be improved further through hierarchical grouping to highlight the commonly repeated subgraphs (e.g. the subgraph including the path L->I->O->P->Q).

How to use

hcientist

license: gpl-3.0
height: 960

hcientist

license: gpl-3.0

hcientist

license: gpl-3.0
border: no
height: 1060

hcientist

# Editor backup files
*.bak
*~

hcientist

license: gpl-3.0

hcientist

license: gpl-3.0
height: 600

hcientist

license: gpl-3.0

hcientist

#!/usr/bin/python
'''Yet another Montage experiment for desktop wallpaper

This version works with a variant on the "Pseudo-Poisson" dart throwing algorithms
that were popular in stochastic ray-tracing years ago. It throws darts at a rectangular
region ensuring that no darts are closer together than a minimum distance. It allows the
minimum distance to scale down so you can have some big pictues and some smaller pictures.

The help text was intended to be self explanatory...

hcientist

angular.module('uitools.app', ['uitools.directives']) 
.controller('AppointmentCtrl', ['$scope', function ($scope) {
    $scope.appointment = {};
    $scope.onDateSelect= function(newValue) {
      $scope.appointment.startTime = newValue;
    };
}]);