| 1 | /* $Id$ $Revision$ */ | 
|---|
| 2 | /* vim:set shiftwidth=4 ts=8: */ | 
|---|
| 3 |  | 
|---|
| 4 | /************************************************************************* | 
|---|
| 5 | * Copyright (c) 2011 AT&T Intellectual Property | 
|---|
| 6 | * All rights reserved. This program and the accompanying materials | 
|---|
| 7 | * are made available under the terms of the Eclipse Public License v1.0 | 
|---|
| 8 | * which accompanies this distribution, and is available at | 
|---|
| 9 | * http://www.eclipse.org/legal/epl-v10.html | 
|---|
| 10 | * | 
|---|
| 11 | * Contributors: See CVS logs. Details at http://www.graphviz.org/ | 
|---|
| 12 | *************************************************************************/ | 
|---|
| 13 |  | 
|---|
| 14 | #ifdef __cplusplus | 
|---|
| 15 | extern "C"{ | 
|---|
| 16 | #endif | 
|---|
| 17 |  | 
|---|
| 18 |  | 
|---|
| 19 |  | 
|---|
| 20 | #ifndef _DIJKSTRA_H_ | 
|---|
| 21 | #define _DIJKSTRA_H_ | 
|---|
| 22 |  | 
|---|
| 23 | #include "defs.h" | 
|---|
| 24 |  | 
|---|
| 25 | #ifdef __cplusplus | 
|---|
| 26 | void dijkstra(int vertex, vtx_data * graph, int n, DistType * dist); | 
|---|
| 27 |  | 
|---|
| 28 | /* Dijkstra bounded to nodes in *unweighted* radius */ | 
|---|
| 29 | void dijkstra_bounded(int vertex, vtx_data * graph, int n, | 
|---|
| 30 | DistType * dist, int bound, int *visited_nodes, | 
|---|
| 31 | int &num_visited_nodes); | 
|---|
| 32 |  | 
|---|
| 33 | #else | 
|---|
| 34 | extern void dijkstra(int, vtx_data *, int, DistType *); | 
|---|
| 35 | extern void dijkstra_f(int, vtx_data *, int, float *); | 
|---|
| 36 |  | 
|---|
| 37 | /* Dijkstra bounded to nodes in *unweighted* radius */ | 
|---|
| 38 | extern int dijkstra_bounded(int, vtx_data *, int, DistType *, int, | 
|---|
| 39 | int *); | 
|---|
| 40 | #endif | 
|---|
| 41 |  | 
|---|
| 42 | #endif | 
|---|
| 43 |  | 
|---|
| 44 | #ifdef __cplusplus | 
|---|
| 45 | } | 
|---|
| 46 | #endif | 
|---|
| 47 |  | 
|---|