|
ID |
Subject |
Status |
Severity |
Last Updated |
Broken in |
Fixed in |
| 120612 |
suggest total path length |
resolved |
|
9 weeks ago |
|
|
| 120611 |
docs of average_path_length($u,$v) |
resolved |
|
9 weeks ago |
|
|
| 115366 |
complement keep all vertices |
resolved |
|
9 weeks ago |
|
|
| 118539 |
Warning from Graph.pm |
resolved |
|
9 weeks ago |
|
|
| 123236 |
[patched] make Graph faster to load |
resolved |
|
9 weeks ago |
|
|
| 114094 |
Problem division by zero |
resolved |
Important |
9 weeks ago |
0.9704 |
|
| 123237 |
git repo in package meta data is not valid now |
resolved |
|
9 weeks ago |
0.9704 |
|
| 107600 |
no modify Storable $VERSION |
resolved |
|
5 years ago |
|
|
| 107567 |
edges() missing on undirected multiedged graph |
resolved |
|
5 years ago |
|
|
| 107394 |
$Storable::VERSION may contain underscores |
resolved |
|
5 years ago |
0.97 |
|
| 104687 |
diameter and centre of a one vertex graph |
resolved |
|
5 years ago |
|
|
| 93278 |
SPT_Dijkstra sometimes returns a wrong answer |
resolved |
Important |
5 years ago |
0.96 |
|
| 65497 |
induced subgraph method |
resolved |
|
5 years ago |
|
|
| 92204 |
longest path is not calculated correctly in this case |
resolved |
|
5 years ago |
|
|
| 78465 |
find_a_cycle and has_cycle are broken |
resolved |
Important |
5 years ago |
|
|
| 85238 |
bug in edges() method? |
resolved |
|
5 years ago |
|
|
| 94046 |
Loading graph produces a warning with Perl 5.16.3 |
resolved |
|
5 years ago |
|
|
| 92427 |
Graph::delete_vertex should not use _edges_at (in all cases) |
resolved |
|
5 years ago |
|
|
| 107195 |
[PATCH] fix POD: add missing NAME header |
resolved |
|
5 years ago |
|
|
| 107194 |
[PATCH] fix a spelling mistake |
resolved |
|
5 years ago |
|
|
| 79143 |
Graph scalar context override causes problems |
resolved |
Normal |
5 years ago |
|
|
| 71793 |
Problem with APSP and default weight 1 |
resolved |
Normal |
5 years ago |
0.94 |
|
| 62626 |
Graph::TransitiveClosure::Matrix contradictory wrt reflexive |
resolved |
|
5 years ago |
|
|
| 85449 |
Graph-0.94 tests fail under perl 5.18.0 |
resolved |
|
5 years ago |
|
|
| 82324 |
Test failures due to hash randomisation in perl 5.17.6 |
resolved |
Important |
5 years ago |
0.94 |
0.95 |
| 91319 |
Fwd: Regarding: Issue faced in pie chart related module. |
resolved |
|
5 years ago |
|
|
| 67213 |
[PATCH] pod fixes |
resolved |
|
7 years ago |
|
0.95 |
| 43580 |
Reversed logic on overload::StrVal() in AdjacencyMap::Vertex::__set_path |
resolved |
Normal |
11 years ago |
0.91 |
|
| 43969 |
->all_successors() stringifies blessed nodes |
resolved |
Important |
11 years ago |
0.91 |
|
| 48090 |
all_reachable on directed $g->add_edges(['a','b'],['b','a']) |
resolved |
|
11 years ago |
0.91 |
|
| 50210 |
Graph-0.91: bug in unionfind parameter |
resolved |
Normal |
11 years ago |
0.91 |
|
| 42549 |
stron |
resolved |
|
11 years ago |
|
|
| 55196 |
Heap 0.80 compatibility fix |
resolved |
Critical |
11 years ago |
|
|
| 55192 |
Broken links in the documentation |
resolved |
Unimportant |
11 years ago |
0.91 |
|
| 26943 |
Heap 0.80 breaks Graph |
resolved |
Critical |
11 years ago |
0.81 |
|
| 42429 |
path_vertices does not return vertices |
resolved |
Important |
12 years ago |
0.90 |
|
| 41735 |
deep_copy does not return a true clone |
resolved |
Important |
12 years ago |
0.86 |
|
| 41736 |
getting predecessors is unreasonably slow for large graphs |
resolved |
Normal |
12 years ago |
0.86 |
|
| 41190 |
add_edge_by_id on multigraph malfunctioning |
resolved |
|
12 years ago |
|
|
| 39805 |
UnionFind: Repeated adds clobbers graph component information |
resolved |
Normal |
12 years ago |
0.84 |
|
| 39614 |
copy should retain more attributes |
resolved |
Normal |
12 years ago |
|
|
| 39444 |
inconsistent return values |
resolved |
Normal |
12 years ago |
0.84 |
|
| 34377 |
recursive successors and predecessors |
resolved |
Wishlist |
12 years ago |
0.84 |
|
| 31068 |
Bugreport: Graph::Undirected, unionfind and connected_components |
resolved |
|
12 years ago |
|
|
| 36729 |
Inconsistent traversal on even trivial graphs |
resolved |
Critical |
12 years ago |
0.84 |
|
| 27959 |
radius method incorrect |
resolved |
Important |
13 years ago |
0.75
0.81 |
|
| 27840 |
add-edge_attributes() on undirected graph wrongly depends on node order |
resolved |
Important |
13 years ago |
0.80
0.81 |
|
| 24417 |
next_successor unavailable in Traversal (PATCH) |
resolved |
Normal |
14 years ago |
0.80 |
|
| 20185 |
problem with SPT_Bellman_Ford |
resolved |
Critical |
14 years ago |
0.75 |
|
| 20476 |
SPT_Bellman_Ford does not respect refvertexed |
resolved |
Normal |
14 years ago |
0.77 |
|
| 20169 |
Problem with SP_Dijkstra()?? |
resolved |
|
14 years ago |
|
|
| 20021 |
bridges() sometimes returns empty list when isolated vertices present |
resolved |
Important |
14 years ago |
0.75 |
|
| 19480 |
articulation_points stalls |
resolved |
Important |
14 years ago |
0.71 |
0.69 |
| 19603 |
Issue... |
resolved |
|
14 years ago |
|
|
| 17160 |
Nodes appear to unblessed after using connected_components() |
resolved |
Important |
15 years ago |
0.69 |
|
| 17405 |
has_cycle with empty args should return FALSE |
resolved |
Unimportant |
15 years ago |
0.67 |
|
| 17165 |
Documentation fix |
resolved |
|
15 years ago |
0.69 |
|
| 17592 |
articulation_points doesn't find all vertices |
resolved |
Important |
15 years ago |
0.69 |
|
| 17164 |
SP_Bellman_Ford() is complaining |
resolved |
|
15 years ago |
0.69 |
|
| 17163 |
SP_Dijkstra() is complaining |
resolved |
|
15 years ago |
0.69 |
|
| 17162 |
Nodes appear to unblessed after using connected_graph() |
resolved |
|
15 years ago |
|
|
| 17161 |
Nodes appear to unblessed after using bridges() |
resolved |
Important |
15 years ago |
0.69 |
|
| 17159 |
Nodes appear to unblessed after using articulation_points() - 2 |
resolved |
Important |
15 years ago |
0.69 |
|
| 17108 |
Nodes appear to unblessed after using articulation_points() |
resolved |
Important |
15 years ago |
0.69 |
|
| 13796 |
set_edge_attribute_by_id() borken in 0.66 |
resolved |
Critical |
15 years ago |
0.66 |
|
| 13352 |
Dijkstra heap logic |
resolved |
Normal |
15 years ago |
0.65 |
|
| 13195 |
add_vertex_get_id/add_edge_get_id() return wrong result on first call |
resolved |
Important |
15 years ago |
0.65 |
|
| 13193 |
Documentation error in set_edge_attributes |
resolved |
Unimportant |
15 years ago |
0.65 |
|
| 13194 |
Documentation error in set_edge_attributes |
resolved |
Unimportant |
15 years ago |
0.65 |
|
| 12509 |
Errors using objects as nodes |
resolved |
Important |
15 years ago |
0.61 |
|
| 11498 |
Performance problem: edge attributes slow source_vertices |
resolved |
Normal |
15 years ago |
0.55 |
|
| 12023 |
delete_vertex |
resolved |
Normal |
16 years ago |
0.60 |
|
| 11465 |
Performance problem: source_vertices in compat02 mode |
resolved |
Normal |
16 years ago |
0.55 |
|
| 11543 |
self-edges reported twice in edges_at |
resolved |
Normal |
16 years ago |
0.55 |
|
| 11494 |
edges($v) |
resolved |
Wishlist |
16 years ago |
0.55 |
|
| 11499 |
Performance problem: edge attributes slow source_vertices |
resolved |
Normal |
16 years ago |
0.55 |
|
| 9482 |
Laplacian Matrices |
resolved |
Wishlist |
16 years ago |
|
|
| 9505 |
Problems with Inheritance of the base Graph class |
resolved |
Important |
16 years ago |
0.50 |
0.20105 |
| 9461 |
successors() fails without stringify() |
resolved |
Normal |
16 years ago |
0.50 |
|
| 9568 |
AdjacencyMap/Light.pm uses Scalar::Util qw(weaken) |
resolved |
Unimportant |
16 years ago |
0.50 |
|
| 9493 |
delete_graph |
resolved |
Important |
16 years ago |
0.50 |
|
| 9481 |
Makefile.PL does not accept PREFIX argument |
resolved |
Important |
16 years ago |
0.50 |
|
| 4420 |
toposort (topological sort, linear extension) fails |
resolved |
Critical |
16 years ago |
0.20101 |
|
| 5168 |
toposort() on cyclic graphs |
resolved |
Unimportant |
16 years ago |
0.20101 |
|
| 6741 |
Documentation for params to Graph::Traversal and control of Traversal starting node |
resolved |
Normal |
16 years ago |
|
|
| 5167 |
Method to see whether graph has any cycles |
resolved |
Wishlist |
16 years ago |
0.20101 |
|
| 6926 |
Copy function does not copy graph attributes |
resolved |
Important |
16 years ago |
|
|
| 1784 |
storing objects in Graph |
resolved |
Wishlist |
16 years ago |
0.20101 |
|
| 1779 |
Test Program for Graph |
resolved |
Critical |
16 years ago |
0.20101 |
|
| 6429 |
classes derived from Graph cannot inherit constructors |
resolved |
Unimportant |
17 years ago |
0.20104 |
|
| 1778 |
SSSP_DAG() and SSSP_Bellman_Ford() hang in Directed Graphs |
resolved |
Critical |
17 years ago |
0.20101 |
|
| 733 |
add_edge does not check for duplicates |
resolved |
Normal |
17 years ago |
0.201 |
|
| 2627 |
union miscounts rank |
resolved |
Unimportant |
17 years ago |
0.20101 |
|
| 516 |
SSSP_Dijkstra does not work |
resolved |
Important |
17 years ago |
0.201 |
|
| 1193 |
strongly_connected_components sometimes gives errornous results for directed graphs |
resolved |
Important |
17 years ago |
0.201 |
|
RT for rt.cpan.org