Skip to content
Snippets Groups Projects
Commit 2bb305c6 authored by Robert Ricci's avatar Robert Ricci
Browse files

Add missing copyrights.

parent 7507de8c
No related branches found
No related tags found
No related merge requests found
Showing
with 103 additions and 2 deletions
#
# EMULAB-COPYRIGHT
# Copyright (c) 2005 University of Utah and the Flux Group.
# All rights reserved.
#
all: test-heap graph2dot test-dijk test-dijk.opt test-dre test-dre.opt all: test-heap graph2dot test-dijk test-dijk.opt test-dre test-dre.opt
%.cmx: %.ml %.cmx: %.ml
......
...@@ -3,6 +3,12 @@ ...@@ -3,6 +3,12 @@
* algorthm * algorthm
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
type ('a,'b) dijk_state = { type ('a,'b) dijk_state = {
graph : ('a, 'b) Graph.t; graph : ('a, 'b) Graph.t;
visited : bool array; (* Not yet used - ditch? *) visited : bool array; (* Not yet used - ditch? *)
......
...@@ -2,6 +2,12 @@ ...@@ -2,6 +2,12 @@
* Functions for computing DRE * Functions for computing DRE
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
(* let compute_dre (graph : ('a, 'b) Graph.t) : float array array = *) (* let compute_dre (graph : ('a, 'b) Graph.t) : float array array = *)
let compute_dre (hops : ('a, 'b) Dijkstra.first_hop array array) : float array array = let compute_dre (hops : ('a, 'b) Dijkstra.first_hop array array) : float array array =
(* Initialize the array of results *) (* Initialize the array of results *)
......
(* (*
* Core of a genetic algorithm * Core of a genetic algorithm
* Copyright 2005 Robert Ricci for the University of Utah *)
* ricci@cs.utah.edu, testbed-ops@emulab.net
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*) *)
type individual = int array;; type individual = int array;;
......
...@@ -3,6 +3,13 @@ ...@@ -3,6 +3,13 @@
* Note: tests are commented out, since this module gets included by other * Note: tests are commented out, since this module gets included by other
* files * files
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
type ('a, 'b) node = { node_contents : 'a; type ('a, 'b) node = { node_contents : 'a;
mutable node_edges : ('a, 'b) edge_list } mutable node_edges : ('a, 'b) edge_list }
and ('a, 'b) edge_list = ('a, 'b) edge list and ('a, 'b) edge_list = ('a, 'b) edge list
......
...@@ -8,6 +8,12 @@ ...@@ -8,6 +8,12 @@
* ... verticies exist only implicitly, as referenced by edges. * ... verticies exist only implicitly, as referenced by edges.
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
(* Hmm, this is awkward, I have to declare all of these types even though they (* Hmm, this is awkward, I have to declare all of these types even though they
* are related. There's probably some better way to do this *) * are related. There's probably some better way to do this *)
type mygraph = (int, unit) Graph.t;; type mygraph = (int, unit) Graph.t;;
......
(* (*
* heap.ml - simple heap module * heap.ml - simple heap module
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
(* Types used by this module *) (* Types used by this module *)
type location = int;; type location = int;;
type weight = int;; type weight = int;;
......
...@@ -3,6 +3,12 @@ ...@@ -3,6 +3,12 @@
* Test functions for my Dijkstra's shortest path implementation * Test functions for my Dijkstra's shortest path implementation
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
(* Hmm, this is awkward, I have to declare all of these types even though they (* Hmm, this is awkward, I have to declare all of these types even though they
* are related. There's probably some better way to do this *) * are related. There's probably some better way to do this *)
type mygraph = (int, int) Graph.t;; type mygraph = (int, int) Graph.t;;
......
...@@ -3,6 +3,12 @@ ...@@ -3,6 +3,12 @@
* Test functions for my Dijkstra's shortest path implementation * Test functions for my Dijkstra's shortest path implementation
*) *)
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
(* Hmm, this is awkward, I have to declare all of these types even though they (* Hmm, this is awkward, I have to declare all of these types even though they
* are related. There's probably some better way to do this *) * are related. There's probably some better way to do this *)
type mygraph = (int, int) Graph.t;; type mygraph = (int, int) Graph.t;;
......
(*
* EMULAB-COPYRIGHT
* Copyright (c) 2005 University of Utah and the Flux Group.
* All rights reserved.
*)
type h = int Heap.heap;; type h = int Heap.heap;;
let h1 = Heap.make_heap 0;; let h1 = Heap.make_heap 0;;
......
// CutSearchPartition.h // CutSearchPartition.h
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#ifndef CUT_SEARCH_PARTITION_H_IP_ASSIGN_2 #ifndef CUT_SEARCH_PARTITION_H_IP_ASSIGN_2
#define CUT_SEARCH_PARTITION_H_IP_ASSIGN_2 #define CUT_SEARCH_PARTITION_H_IP_ASSIGN_2
......
// GraphConverter.h // GraphConverter.h
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#ifndef GRAPH_CONVERTER_H_IP_ASSIGN_2 #ifndef GRAPH_CONVERTER_H_IP_ASSIGN_2
#define GRAPH_CONVERTER_H_IP_ASSIGN_2 #define GRAPH_CONVERTER_H_IP_ASSIGN_2
......
// RatioCutPartition.h // RatioCutPartition.h
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#ifndef RATIO_CUT_PARTITION_H_IP_ASSIGN_2 #ifndef RATIO_CUT_PARTITION_H_IP_ASSIGN_2
#define RATIO_CUT_PARTITION_H_IP_ASSIGN_2 #define RATIO_CUT_PARTITION_H_IP_ASSIGN_2
......
// add-x.cc // add-x.cc
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#include <iostream> #include <iostream>
using namespace std; using namespace std;
......
// difference.cc // difference.cc
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#include <iostream> #include <iostream>
#include <fstream> #include <fstream>
#include <string> #include <string>
......
// graph2single-source.cc // graph2single-source.cc
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#include <iostream> #include <iostream>
#include <string> #include <string>
#include <sstream> #include <sstream>
......
// route2dist.cc // route2dist.cc
/*
* EMULAB-COPYRIGHT
* Copyright (c) 2004 University of Utah and the Flux Group.
* All rights reserved.
*/
#include <iostream> #include <iostream>
#include <sstream> #include <sstream>
#include <string> #include <string>
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment